Memetic Mission Management [Application Notes]

This paper presents novel area coverage algorithms that have been validated using Boeing VSTL hardware. Even though the multi-vehicle search area coverage problem is large and complex, several new memetic computing methods have been presented that decompose, allocate and optimize the exploration of a search area for multiple heterogeneous vehicles. These new methods were shown to have good performance and quality, and as they are defined in a general way, these methods are applicable to many other problem domains. The methods have been combined into a mission-planner architecture that is able to adaptively control the behavior of multiple vehicles with dynamic vehicle capabilities and environments for mission assurance. The topic of mission-planning architectures and optimization of swarms of autonomous vehicles is a young and exciting field with many opportunities for research. More computationally efficient methods for decomposition may be useful, as well as the application of next-generation meta-learning architectures for path planning. In addition to the existing collision avoidance, path de-confliction during planning can improve safety and efficiency.

[1]  XIV REFERENCES , 1957 .

[2]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[3]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

[4]  Stephen Grossberg,et al.  ART 2-A: an adaptive resonance algorithm for rapid category learning and recognition , 1991, IJCNN-91-Seattle International Joint Conference on Neural Networks.

[5]  Lynne E. Parker,et al.  L-ALLIANCE: a mechanism for adaptive action selection in heterogeneous multi-robot teams , 1995 .

[6]  Rachid Alami,et al.  A General Framework For Multi-Robot Cooperation and Its Implementation on a Set of Three Hilare Robots , 1995, ISER.

[7]  M. I. Ribeiro,et al.  Complete coverage path planning and guidance for cleaning robots , 1997, ISIE '97 Proceeding of the IEEE International Symposium on Industrial Electronics.

[8]  B. Freisleben,et al.  Genetic local search for the TSP: new results , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[9]  Peter M. A. Sloot,et al.  Preserving Locality for Optimal Parallelism in Task Allocation , 1997, HPCN Europe.

[10]  Russell C. Eberhart,et al.  Parameter Selection in Particle Swarm Optimization , 1998, Evolutionary Programming.

[11]  Barry Brumitt,et al.  GRAMMPS: a generalized mission planner for multiple mobile robots in unstructured environments , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

[12]  R. Belew,et al.  Evolutionary algorithms with local search for combinatorial optimization , 1998 .

[13]  Rachid Alami,et al.  M+: a scheme for multi-robot cooperation through negotiated task allocation and achievement , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[14]  H. Choset,et al.  Toward robust sensor based exploration by constructing reduced generalized Voronoi graph , 1999, Proceedings 1999 IEEE/RSJ International Conference on Intelligent Robots and Systems. Human and Environment Friendly Robots with High Intelligence and Emotional Quotients (Cat. No.99CH36289).

[15]  Towards sensor based coverage with robot teams , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[16]  Cheng-Yan Kao,et al.  Solving traveling salesman problems by combining global and local search mechanisms , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[17]  Gaurav S. Sukhatme,et al.  Multi-robot task allocation in the light of uncertainty , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[18]  Maja J. Mataric,et al.  Sold!: auction methods for multirobot coordination , 2002, IEEE Trans. Robotics Autom..

[19]  Hisao Ishibuchi,et al.  Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling , 2003, IEEE Trans. Evol. Comput..

[20]  D. Wunsch,et al.  Using adaptive resonance theory and local optimization to divide and conquer large scale traveling salesman problems , 2003, Proceedings of the International Joint Conference on Neural Networks, 2003..

[21]  Daniele Nardi,et al.  An analysis of coordination in Multi-Robot Systems , 2003, SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483).

[22]  Maja J. Mataric,et al.  Multi-robot task allocation: analyzing the complexity and optimality of key architectures , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[23]  Donald C. Wunsch,et al.  Million city traveling salesman problem solution by divide and conquer clustering with adaptive resonance neural networks , 2003, Neural Networks.

[24]  Forschungsinstitut für Diskrete.  Chained Lin-Kernighan for Large Traveling Salesman Problems , 2003 .

[25]  A. Keane,et al.  Evolutionary Optimization of Computationally Expensive Problems via Surrogate Modeling , 2003 .

[26]  Cheng-Yan Kao,et al.  An evolutionary algorithm for large traveling salesman problems , 2004, IEEE Trans. Syst. Man Cybern. Part B.

[27]  Jin Bae Park,et al.  Complete coverage navigation of cleaning robots using triangular-cell-based map , 2004, IEEE Transactions on Industrial Electronics.

[28]  J.J. Gu,et al.  Collective robotics - a survey of control and communication techniques , 2004, 2004 International Conference on Intelligent Mechatronics and Automation, 2004. Proceedings..

[29]  Andy J. Keane,et al.  Meta-Lamarckian learning in memetic algorithms , 2004, IEEE Transactions on Evolutionary Computation.

[30]  Zhiqiang Zheng,et al.  Combinatorial Bids based Multi-robot Task Allocation Method , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[31]  Noam Hazon,et al.  Redundancy, Efficiency and Robustness in Multi-Robot Coverage , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[32]  Dirk Schulz,et al.  A probabilistic approach to coordinated multi-robot indoor surveillance , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[33]  Hosam Hanna,et al.  Decentralized approach for multi-robot task allocation problem with uncertain task execution , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[34]  Howie Choset,et al.  Sensor-based coverage with extended range detectors , 2006, IEEE Transactions on Robotics.

[35]  Ryan J. Meuth.  Adaptive multi-vehicle mission planning for search area coverage , 2007 .

[36]  W. Jatmiko,et al.  A pso-based mobile robot for odor source localization in dynamic advection-diffusion with obstacles environment: theory, simulation and measurement , 2007, IEEE Computational Intelligence Magazine.

[37]  Dirk V. Arnold,et al.  Evolutionary Gradient Search Revisited , 2007, IEEE Transactions on Evolutionary Computation.

[38]  T. Back,et al.  Evolutionary algorithms for real world applications [Application Notes] , 2008, IEEE Computational Intelligence Magazine.

[39]  Yew-Soon Ong,et al.  A proposition on memes and meta-memes in computing for higher-order learning , 2009, Memetic Comput..

[40]  Donald C. Wunsch,et al.  Adaptive task allocation for search area coverage , 2009, 2009 IEEE International Conference on Technologies for Practical Robot Applications.

[41]  Shoichi Hasegawa,et al.  Development and investigation of efficient GA/PSO-HYBRID algorithm applicable to real-world design optimization , 2009, IEEE Comput. Intell. Mag..

[42]  Fakhri Karray,et al.  An optimization algorithm for the coordinated hybrid agent framework , 2005, IEEE International Conference on Systems, Man and Cybernetics.