Selfish and coordinative planning for multiple mobile robots by genetic algorithm
- 24 August 2005
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2686-2691
- https://doi.org/10.1109/cdc.1992.371330
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Several Path-Planning Algorithms Mobile Robot for an Uncertain Workspace and their EvaluationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Control strategy for a network of cellular robots-determination of a master cell for cellular robotic network based on a potential energyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficient method to generate collision free paths for an autonomous mobile robot based on new free space structuring approachPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Consideration on cooperation of multiple autonomous mobile robots-introduction to modest cooperationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- New strategy for hierarchical intelligent control of robotic manipulator-hybrid neuromorphic and symbolic controlPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- An efficient algorithm for finding a collision‐free path among polyhedral obstaclesJournal of Robotic Systems, 1990
- Solving the find-path problem by good representation of free spaceIEEE Transactions on Systems, Man, and Cybernetics, 1983
- An algorithm for planning collision-free paths among polyhedral obstaclesCommunications of the ACM, 1979