Skip to main content

Using ASP to Improve the Information Reuse in Mechanical Assembly Sequence Planning

  • Conference paper
PRICAI 2010: Trends in Artificial Intelligence (PRICAI 2010)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6230))

Included in the following conference series:

  • 1630 Accesses

Abstract

Modern product design and manufacturing process are highly integrated and exposed to frequent changes. This has made information reuse play an increasingly important role in improving the efficiency of the product development process. Mechanical Assembly Sequence Planning (MASP) is a key issue in the manufacturing of a product. Known methods for MASP are not satisfactory from the aspect of information reuse. This paper proposes an Answer Set Programming (ASP) based solution to MASP, where information reuse is enhanced by dividing an ASP program into EDB (extensional database) and IDB (intensional database) such that IDB can be shared by all the assemblies with the same number of parts. Compared with other approaches for MASP, this is a great advantage. Experiments are conducted to show the applicability and performance of our method by using different answer set solvers.

This work is supported by National Natural Science Foundation of China (No.60803033, 60663005, 60903079, and 60963010), and Guangxi Natural Science Foundation of China (GuiKeQing 0728093, 0728089, and 0542036).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baldwin, D.F., Abeel, T.E., et al.: An integrated computer aid for generating and evaluating assembly sequences for mechanical products. IEEE Trans. Auto. Con. 7(1), 78–94 (1991)

    Article  Google Scholar 

  2. Baral, C., Gelfond, M.: Logic programming and knowledge representation. Journal of Logic Programming 19, 73–148 (1994)

    Article  MathSciNet  Google Scholar 

  3. Gelfond, M., Lifschitz, V.: Classic negation in logic programs and disjunctive databases. Next Generation Computing 9, 365–385 (1991)

    Article  Google Scholar 

  4. Giunchiglia, E., Lierler, Y., Maratea, M.: Cmodels-2: SAT-Based Answer Set Programming. In: Proceedings of AAAI (2004)

    Google Scholar 

  5. Gottipolu, R.B., Ghosh, K.: A simplified and efficient representation for evaluation and selection of assembly sequences. Computer in Industry 50(3), 251–264 (2003)

    Article  Google Scholar 

  6. Gu, T., Liu, H.: The symbolic OBDD scheme for generating mechanical assembly sequences. Formal Methods in System Design 33(1-3), 29–44 (2008)

    Article  MATH  Google Scholar 

  7. de Mello, L.S.H., Sanderson, A.C.: A correct and complete algorithm for the generation of mechanical assembly sequences. IEEE Trans. Auto. Con. 7(2), 228–240 (1991)

    Article  Google Scholar 

  8. de Mello, L.S.H., Sanderson, A.C.: Representation of mechanical assembly sequences. IEEE Transactions on Robotics Automation 7(2), 211–227 (1991)

    Article  Google Scholar 

  9. Hong, D.S., Cho, H.S.: Generation of robotic assembly sequences using a simulated annealing. In: Proceedings of the IEEE/RSJ IROS 1999, pp. 1247–1252 (1999)

    Google Scholar 

  10. Leone, N., Pfeifer, G., et al.: The DLV system for knowledge representation and reasoning. ACM TOCL 7(3), 499–562 (2006)

    Article  MathSciNet  Google Scholar 

  11. Lifschitz, V.: Answer set programming and plan generation. Artificial Intelligence 138(1-2), 39–54 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  12. Marian, R.M., Luong, L.H.S., et al.: Assembly sequence planning and optimization using genetic algorithms. Applied Soft Computing 2(3), 223–253 (2003)

    Article  Google Scholar 

  13. Niemela, I., Simons, P., Syrjanen, T.: Smodels: A System for Answer Set Programming. In: Proceedings of NMR 2000, April 9-11 (2000)

    Google Scholar 

  14. Reiter, R.: On closed world databases. In: Gallaire, Minker (eds.) Logic and Databases, pp. 55–76. Plenum Press, New York (1978)

    Google Scholar 

  15. Romney, B., Godard, C., et al.: An efficient system for geometric assembly sequence generation and evaluation. In: Proceedings of the 1995 ASME International Computers in Engineering Conference, pp. 699–712 (1995)

    Google Scholar 

  16. Su, Q.: Applying case-based reasoning in assembly sequence planning. International Journal of Product Research 45(1), 29–47 (2007)

    Article  MATH  Google Scholar 

  17. Wilson, R.H.: Minimizing user queries in interactive assembly planning. IEEE Transactions on Automatic Control 11(2), 308–311 (1995)

    Google Scholar 

  18. Yin, Z.P., Han, D., et al.: A connector-based hierarchical approach to assembly sequence planning for mechanical assemblies. Computer Aided Design 35(1), 37–56 (2003)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhao, L., Wang, X., Qian, J., Gu, T. (2010). Using ASP to Improve the Information Reuse in Mechanical Assembly Sequence Planning. In: Zhang, BT., Orgun, M.A. (eds) PRICAI 2010: Trends in Artificial Intelligence. PRICAI 2010. Lecture Notes in Computer Science(), vol 6230. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15246-7_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15246-7_36

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15245-0

  • Online ISBN: 978-3-642-15246-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics