Maze Exploration Algorithm via Distributed Collaborative Control System Considering Communicable Range-Reference-Cited by-同舟云学术

Maze Exploration Algorithm via Distributed Collaborative Control System Considering Communicable Range

Published:2018-04-15 Issue:4 Volume:31 Page:167-176
ISSN:1342-5668
Container-title:Transactions of the Institute of Systems, Control and Information Engineers
language:en
Short-container-title:Transactions of ISCIE

Author:

Mochizuki Yukari¹,Sawada Kenji²,Shin Seiichi¹

Affiliation:

1. Graduate School of Informatics and Engineering, The University of Electro-Cmmunications

2. Info-Powered Energy System Research Center, The University of Electro-Cmmunications

Publisher

The Institute of Systems, Control and Information Engineers

Link

https://www.jstage.jst.go.jp/article/iscie/31/4/31_167/_pdf

Reference9 articles.

1. [1] K. Knight: Are many reactive agents better than a few deliberative ones?; Proceedings of the Thirteen International Joint Conference on Artificial Intelligence, pp. 432-437 (1993)

2. [3] R. S. Bharathi, R. Priyadharshni and S. Ramesh: Artificial bee colony algorithm to find optimum path for mobile agents in wireless sensor networks; IEEE International Conference on Advanced Communication Control and Computing Technologies, pp. 842- 846 (2014)

3. [4] E. H. Kivelevich and K. Cohen: Multi-agent maze exploration; Journal of Aerospace Computing, Information, and Communication, Vol. 7, pp. 391-405 (2010)

4. [5] L. Kalinovcic, T. Petrovic, S. Bogdan and V. Bobanac: Modified Banker's algorithm for scheduling in multi-AGV systems; IEEE International Conference on Automation Science and Engineering, pp. 351-356 (2011)

5. [6] N. Wu and M. C. Zhou: AGV routing for conflict resolution in AGV systems; International Conference on Robotics & Automation, pp. 14-19 (2003)