Path planning for multiple mobile robots under double-warehouse

Abstract This work investigates the conflict-free path planning problems for efficient guidance of multiple mobile robots under the dynamic double-warehouse environment, a challenging problem that appears recurrently in a wide range of applications such as the service robots moving in a multistory building. United with two symmetrical transfer elevators, double-warehouse consists of two parallel warehouses. Within each warehouse, the polynomial based paths are subject to constraints such as motion boundaries, kinematics constraints, obstacle-avoidance, limited resource of elevators and smoothness. We formulate the shortest path planning problems as one time-varying nonlinear programming problem (TNLPP) while restricted to the above constraints, and apply the multi-phase strategy to reduce their difficulty. We present the new variant algorithms of PSO named constriction factor and random perturb PSO (Con-Per-PSO) and the simulating annealing PSO (SA-PSO) to achieve the solution. Numerical simulations verify that, our approach can fulfill multiple mobile robots path planning problems under double-warehouse successfully.

[1]  Pablo González de Santos,et al.  The evolution of robotics research , 2007, IEEE Robotics & Automation Magazine.

[2]  Cheng-Yan Kao,et al.  Applying Family Competition to Evolution Strategies for Constrained Optimization , 1997, Evolutionary Programming.

[3]  Shugen Ma,et al.  Intelligent mobile manipulator navigation using adaptive neuro-fuzzy systems , 2005, Inf. Sci..

[4]  Takanori Shibata,et al.  Motion Planning by Genetic Algorithm for a Redundant Manipulator Using a Model of Criteria of Skilled Operators , 1997, Inf. Sci..

[5]  Kit Yan Chan,et al.  Polynomial modeling for time-varying systems based on a particle swarm optimization algorithm , 2011, Inf. Sci..

[6]  Christopher R. Houck,et al.  On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with GA's , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[7]  Jun Ota,et al.  Multi-agent robot systems as distributed autonomous systems , 2006, Adv. Eng. Informatics.

[8]  Zhihua Qu,et al.  A new analytical solution to mobile robot trajectory generation in the presence of moving obstacles , 2004, IEEE Transactions on Robotics.

[9]  Edite M. G. P. Fernandes,et al.  Robot trajectory planning with semi-infinite programming , 2004, Eur. J. Oper. Res..

[10]  Huijun Gao,et al.  A Constrained Evolutionary Computation Method for Detecting Controlling Regions of Cortical Networks , 2012, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12]  Yi Guo,et al.  A distributed and optimal motion planning approach for multiple mobile robots , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[13]  Hanan Samet,et al.  A hierarchical strategy for path planning among moving obstacles [mobile robot] , 1989, IEEE Trans. Robotics Autom..

[14]  Tomás Lozano-Pérez,et al.  On multiple moving objects , 2005, Algorithmica.

[15]  M. Clerc,et al.  The swarm and the queen: towards a deterministic and adaptive particle swarm optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[16]  Maurice Clerc,et al.  The particle swarm - explosion, stability, and convergence in a multidimensional complex space , 2002, IEEE Trans. Evol. Comput..

[17]  Igor Skrjanc,et al.  A Case Study of the Collision-Avoidance Problem Based on Bernstein–Bézier Path Tracking for Multiple Robots with Known Constraints , 2010, J. Intell. Robotic Syst..

[18]  Ammar W. Mohemmed,et al.  Solving shortest path problem using particle swarm optimization , 2008, Appl. Soft Comput..

[19]  Yong Wang,et al.  A Multiobjective Optimization-Based Evolutionary Algorithm for Constrained Optimization , 2006, IEEE Transactions on Evolutionary Computation.

[20]  Max Q.-H. Meng,et al.  An efficient neural network approach to dynamic robot motion planning , 2000, Neural Networks.

[21]  Jonathan A. Wright,et al.  Self-adaptive fitness formulation for constrained optimization , 2003, IEEE Trans. Evol. Comput..

[22]  Jian Yang,et al.  Comparison of Optimal Solutions to Real-Time Path Planning for a Mobile Vehicle , 2005, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[23]  M. Zamirian,et al.  A novel approach for multiple mobile objects path planning: Parametrization method and conflict resolution strategy , 2012 .

[24]  Micha Sharir,et al.  Motion planning in the presence of moving obstacles , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[25]  Christopher M. Clark,et al.  Applying kinodynamic randomized motion planning with a dynamic priority system to multi-robot space systems , 2002, Proceedings, IEEE Aerospace Conference.

[26]  Wolfram Burgard,et al.  Finding and Optimizing Solvable Priority Schemes for Decoupled Path Planning Techniques for Teams of Mobile Robots , 2002, PuK.

[27]  Oussama Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1986 .

[28]  Chia-Feng Juang,et al.  Evolutionary-Group-Based Particle-Swarm-Optimized Fuzzy Controller With Application to Mobile-Robot Navigation in Unknown Environments , 2011, IEEE Transactions on Fuzzy Systems.

[29]  Dong Sun,et al.  Coordinated Motion Planning for Multiple Mobile Robots Along Designed Paths With Formation Requirement , 2011, IEEE/ASME Transactions on Mechatronics.

[30]  Yang Tang,et al.  Controller design for synchronization of an array of delayed neural networks using a controllable probabilistic PSO , 2011, Inf. Sci..

[31]  M. H. Farahi,et al.  A novel algorithm for solving optimal path planning problems based on parametrization method and fuzzy aggregation , 2009 .

[32]  Igor Skrjanc,et al.  Optimal cooperative collision avoidance between multiple robots based on Bernstein-Bézier curves , 2010, Robotics Auton. Syst..

[33]  S. Zucker,et al.  Toward Efficient Trajectory Planning: The Path-Velocity Decomposition , 1986 .

[34]  R. Eberhart,et al.  Comparing inertia weights and constriction factors in particle swarm optimization , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[35]  M. Zamirian,et al.  Path Planning for Mobile Objects in Four-Dimension Based on Particle Swarm Optimization Method with Penalty Function , 2013 .

[36]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[37]  Jean-Claude Latombe,et al.  Using a PRM planner to compare centralized and decoupled planning for multi-robot systems , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[38]  Huijun Gao,et al.  Evolutionary Pinning Control and Its Application in UAV Coordination , 2012, IEEE Transactions on Industrial Informatics.

[39]  Ellips Masehian,et al.  Classic and Heuristic Approaches in Robot Motion Planning A Chronological Review , 2007 .

[40]  Yoshiaki Shirai,et al.  Modeling motion uncertainty of moving obstacles for robot motion planning , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[41]  Yang Tang,et al.  Parameters identification of unknown delayed genetic regulatory networks by a switching particle swarm optimization algorithm , 2011, Expert Syst. Appl..

[42]  Libor Preucil,et al.  Robot Path Planning using Particle Swarm Optimization of Ferguson Splines , 2006, 2006 IEEE Conference on Emerging Technologies and Factory Automation.

[43]  B. John Oommen,et al.  On the problem of multiple mobile robots cluttering a workspace , 1992, Inf. Sci..

[44]  Yang Tang,et al.  Feedback learning particle swarm optimization , 2011, Appl. Soft Comput..

[45]  Renato Seiji Tavares,et al.  Simulated annealing with adaptive neighborhood: A case study in off-line robot path planning , 2011, Expert Syst. Appl..

[46]  Zhao Xinchao.  A perturbed particle swarm algorithm for numerical optimization , 2010 .

[47]  Somnuk Phon-Amnuaisuk,et al.  Navigating a robotic swarm in an uncharted 2D landscape , 2010, Appl. Soft Comput..