Abstract
A distributed approach is shown to coordinate the motions of transport tables for the cellular warehouse problem. In this approach, the tables are considered to be autonomous agents, and a built-in behavior function given by artificial neural networks (ANNs) and the evolved problem-oriented connection weights navigate the agents to their specified goals. To determine the agent to be moved, a measure of the priority to move is introduced. We show that distributed agents with the learned behavior function and the negotiation value perform a similar strategy to a “serializable” solution forN-puzzle problems, which provides a good heuristic strategy for large-scale problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Sharma R, Aloimonos Y (1992) Coordinated motion planning: the warehouse's problem with constraints on free space. IEEE Trans Syst Man Cybern 22:130–141
Sarrafzadeh M, Maddila SR (1995) Discrete warehouse problem. Theor Comput Sci 140:231–247
Knight K (1993) Are many reactive agents better than a few deliberative ones? Proceedings of the 13th International Joint Conference on Artificial Intelligence Morgan Kaufmann, San Mateo, p 432–437
Yokoo M, Kitamura Y (1996) Multiagent real-time-A* with selection: introducing competition in cooperative search. Proceedings of the 2nd International Conference on Multi-Agent systems, AAAI Press, Menlo Park, p 409–416
Angeline PJ, Saunders GM, Polack JB (1994) An evolutionary algorithm that constructs recurrent neural networks. IEEE Trans Neural Networks 5:54–65
Fogel DB (1994) An introduction to simulated evolution optimization. IEEE Trans Neural Networks 5:3–14
Minagawa M (1998) Solving block stacking problems in cellular space. Intelligent engineering systems through artificial neural networks, vol 8. ASME, New York, p 347–356
Parker LE (1993) Adaptive action selection for cooperative agent teams, From animals to animats, vol 2. MIT Press, Cambridge, p 442–450
Ribeiro F, Barthes JP, Oliveila E (1993) Dynamic selection of action sequences. From animals to animats, vol 2. MIT Press, Cambridge, p 189–195
Hama K, Mikami S, Suzuki K et al. (2001) Learning motion coordination algorithm for distributed agents in cellular warehouse problem. Proceedings of the 6th International Symposium on Artificial Life and Robotics (AROB 6), vol 2, p 539–542
Korf RE (1987) Planning as search: a quantitative approach. Artif Intell 33:65–88
Araya S, Momohara T, Okamoto Y et al. (1996) Problem space analysis of the 8-Puzzle and its complete solution (in Japanese). J Jpn Soc Artif Intell 11:478–485
Author information
Authors and Affiliations
Corresponding author
About this article
Cite this article
Hama, K., Mikami, S., Suzuki, K. et al. Motion coordination algorithm for distributed agents in the cellular warehouse problem. Artif Life Robotics 6, 3–10 (2002). https://doi.org/10.1007/BF02481204
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF02481204