Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A prioritized planning algorithm of trajectory coordination based on time windows for multiple AGVs with delay disturbance

A prioritized planning algorithm of trajectory coordination based on time windows for multiple... In the running of multiple automated guided vehicles (AGVs) in warehouses, delay problems in motions happen unavoidably as there might exist some disabled components of robots, the instability of networks and the interference of people walking. Under this case, robots would not follow the designed paths and the coupled relationship between temporal and space domain for paths is broken. And there is no doubt that other robots are disturbed by the ones where delays happen. Finally, this brings about chaos or even breakdown of the whole system. Therefore, taking the delay disturbance into consideration in the path planning of multiple robots is an issue worthy of attention and research.Design/methodology/approachThis paper proposes a prioritized path planning algorithm based on time windows to solve the delay problems of multiple AGVs. The architecture is a unity consisting of three components which are focused on scheduling AGVs under normal operations, delays of AGVs, and recovery of AGVs. In the components of scheduling AGVs under normal operations and recovery, this paper adopts a dynamic routing method based on time windows to ensure the coordination of multiple AGVs and efficient completion of tasks. In the component for scheduling AGVs under delays, a dynamical prioritized local path planning algorithm based on time windows is designed to solve delay problems. The introduced planning principle of time windows would enable the algorithm to plan new solutions of trajectories for multiple AGVs, which could lower the makespan. At the same time, the real-time performance is acceptable based on the planning principle which stipulates the parameters of local time windows to ensure that the computation of the designed algorithm would not be too large.FindingsThe simulation results demonstrate that the proposed algorithm is more efficient than the state-of-the-art method based on homotopy classes, which aims at solving the delay problems. What is more, it is validated that the proposed algorithm can achieve the acceptable real-time performance for the scheduling in warehousing applications.Originality/valueBy introducing the planning principle and generating delay space and local adjustable paths, the proposed algorithm in this paper can not only solve the delay problems in real time, but also lower the makespan compared with the previous method. The designed algorithm guarantees the scheduling of multiple AGVs with delay disturbance and enhances the robustness of the scheduling algorithm in multi-AGV system. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Assembly Automation Emerald Publishing

A prioritized planning algorithm of trajectory coordination based on time windows for multiple AGVs with delay disturbance

Tai, Ruochen; Wang, Jingchuan; Chen, Weidong
Assembly Automation , Volume 39 (5): 16 – Oct 18, 2019
Download PDF
16 pages

Loading next page...
 
/lp/emerald-publishing/a-prioritized-planning-algorithm-of-trajectory-coordination-based-on-URzDenbtyg
Publisher
Emerald Publishing
Copyright
© Emerald Publishing Limited
ISSN
0144-5154
DOI
10.1108/aa-03-2019-0054
Publisher site
See Article on Publisher Site

Abstract

In the running of multiple automated guided vehicles (AGVs) in warehouses, delay problems in motions happen unavoidably as there might exist some disabled components of robots, the instability of networks and the interference of people walking. Under this case, robots would not follow the designed paths and the coupled relationship between temporal and space domain for paths is broken. And there is no doubt that other robots are disturbed by the ones where delays happen. Finally, this brings about chaos or even breakdown of the whole system. Therefore, taking the delay disturbance into consideration in the path planning of multiple robots is an issue worthy of attention and research.Design/methodology/approachThis paper proposes a prioritized path planning algorithm based on time windows to solve the delay problems of multiple AGVs. The architecture is a unity consisting of three components which are focused on scheduling AGVs under normal operations, delays of AGVs, and recovery of AGVs. In the components of scheduling AGVs under normal operations and recovery, this paper adopts a dynamic routing method based on time windows to ensure the coordination of multiple AGVs and efficient completion of tasks. In the component for scheduling AGVs under delays, a dynamical prioritized local path planning algorithm based on time windows is designed to solve delay problems. The introduced planning principle of time windows would enable the algorithm to plan new solutions of trajectories for multiple AGVs, which could lower the makespan. At the same time, the real-time performance is acceptable based on the planning principle which stipulates the parameters of local time windows to ensure that the computation of the designed algorithm would not be too large.FindingsThe simulation results demonstrate that the proposed algorithm is more efficient than the state-of-the-art method based on homotopy classes, which aims at solving the delay problems. What is more, it is validated that the proposed algorithm can achieve the acceptable real-time performance for the scheduling in warehousing applications.Originality/valueBy introducing the planning principle and generating delay space and local adjustable paths, the proposed algorithm in this paper can not only solve the delay problems in real time, but also lower the makespan compared with the previous method. The designed algorithm guarantees the scheduling of multiple AGVs with delay disturbance and enhances the robustness of the scheduling algorithm in multi-AGV system.

Journal

Assembly Automation – Emerald Publishing

Published: Oct 18, 2019

Keywords: Delays; Local planning; Time windows; Trajectory coordination; Automated guided vehicles (AGV)

References

  • Policy search for multi-robot coordination under uncertainty
    Amato, C.; Konidaris, G.; Anders, A.; Cruz, G.; How, J.P.; Kaelbling, L.P.
  • Provably safe and deadlock-free execution of multi-robot plans under delaying disturbances
    Čáp, M.; Gregoire, J.; Frazzoli, E.
  • Generalized sampling-based motion planners
    Chakravorty, S.; Kumar, S.
  • Mutual information-based multi-AUV path planning for scalar field sampling using multidimensional RRT*
    Cui, R.; Li, Y.; Yan, W.
  • Ensemble coordination approach in multi-agv systems applied to industrial warehouses
    Digani, V.; Sabattini, L.; Secchi, C.; Fantuzzi, C.
  • Hierarchical traffic control for partially decentralized coordination of multi AGV systems in industrial environments
    Digani, V.; Sabattini, L.; Secchi, C.; Fantuzzi, C.
  • Decentralized control of multi-AGV systems in autonomous warehousing applications
    Draganjac, I.; Miklić, D.; Kovačić, Z.; Vasiljević, G.; Bogdan, S.
  • Fast scheduling of robot teams performing tasks with temporospatial constraints
    Gombolay, M.C.; Wilcox, R.J.; Shah, J.A.
  • Locally-optimal multi-robot navigation under delaying disturbances using homotopy constraints
    Gregoire, J.; Čáp, M.; Frazzoli, E.
  • Zone design and control for vehicle collision prevention and load balancing in a zone control AGV system
    Ho, Y.C.; Liao, T.W.
  • Multiagent reinforcement learning with unshared value functions
    Hu, Y.; Gao, Y.; An, B.
  • Provable systemwide safety in intelligent intersections
    Kowshik, H.; Caveney, D.; Kumar, P.R.
  • Neural network approximation-based near-optimal motion planning with kinodynamic constraints using RRT
    Li, Y.; Cui, R.; Li, Z.; Xu, D.
  • Deadlock control of automated manufacturing systems based on petri nets – a literature review
    Li, Z.; Wu, N.; Zhou, M.
  • An MDP-based approximation method for goal constrained multi-MAV planning under action uncertainty
    Liu, L.; Michael, N.
  • Actuator-Fault-Tolerant trajectory tracking control for Multi-Robot system under directed network topologies and communication delays
    Liu, Z.; Lu, J.; Wang, H.; Chen, W.; Liu, Y.
  • Distributed Pair-Wised transportation planning with incidental deliveries for multiple mobile robots
    Liu, Z.; Wang, H.; Chen, W.; Liu, Y.
  • A hierarchical framework for coordinating Large-Scale robot networks
    Liu, Z.; Zhou, S.; Wang, H.; Shen, Y.; Li, H.; Liu, Y.
  • Control program design for automated guided vehicle systems via petri nets
    Luo, J.; Ni, H.; Zhou, M.
  • Multi-Agent path finding with delay probabilities
    Ma, H.; Kumar, T.K.S.; Koenig, S.
  • Decentralized coordination system for multiple AGVs in a structured environment
    Manca, S.; Fagiolini, A.; Pallottino, L.
  • Petri net decomposition approach to optimization of route planning problems for AGV systems
    Nishi, T.; Maeno, R.
  • Petri net decomposition approach for dispatching and conflict-free routing of bidirectional automated guided vehicle systems
    Nishi, T.; Tanaka, Y.
  • An efficient control strategy for the traffic coordination of AGVs
    Olmi, R.; Secchi, C.; Fantuzzi, C.
  • Solving transition-independent multi-agent MDPs with sparse interactions
    Scharpff, J.; Roijers, D.M.; Oliehoek, F.A.; Spaan, M.T.J.; de Weerdt, M.M.
  • Time windows based dynamic routing in multi-AGV systems
    Smolic-Rocak, N.; Bogdan, S.; Kovacic, Z.; Petrovic, T.
  • Algorithms for heterogeneous, multiple depot, multiple unmanned vehicle path planning problems
    Sundar, K.; Rathinam, S.
  • A Time-Efficient approach to solve conflicts and deadlocks for scheduling AGVs in warehousing applications
    Tai, R.; Wang, J.; Tian, W.; Chen, W.; Wang, H.; Zhou, Y.
  • Conflict-free route planning in dynamic environments
    ter Mors, A.W.
  • Shortest routing of bidirectional automated guided vehicles avoiding deadlock and blocking
    Wu, N.; Zhou, M.
  • Multi-agent coordination by decentralized estimation and control
    Yang, P.; Freeman, R.; Lynch, K.
  • Rendezvous path planning for multiple autonomous marine vehicles
    Zeng, Z.; Sammut, K.; Lian, L.; Lammas, A.; He, F.; Tang, Y.
  • Conflict-based search for optimal multi-agent pathfinding
    Sharona, G.; Sterna, R.; Felnera, A.; Sturtevant, N.R.