Vehicle scheduling in 2D shop floor environments

Purpose – The purpose of this paper is to develop an efficient method for solving a vehicle scheduling problem (VSP) in 2D industrial environments. An autonomous vehicle is requested to serve a set of work centers in the shop floor providing transport and delivery tasks while avoiding collisions with obstacles during its travel. The objective is to find a minimum in length, collision‐free vehicle routing schedule that serves timely as many as possible work centers in the shop floor.Design/methodology/approach – First, the vehicle's environment is mapped into a 2D B‐Spline surface embedded in 3D Euclidean space using a robust geometric model. Then, a modified genetic algorithm is applied on the generated surface to search for an optimum legal route schedule that satisfies the requirements of the vehicle's mission.Findings – Simulation experiments show that the method is robust enough and can determine in a reasonable computation time a solution to VSP under consideration.Originality/value – There is a gap ...

[1]  Nikos A. Aspragathos,et al.  Two-dimensional motion-planning for nonholonomic robots using the bump-surfaces concept , 2006, Computing.

[2]  Giuseppe Oriolo,et al.  Local incremental planning for a car-like robot navigating among obstacles , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[3]  Les A. Piegl,et al.  The NURBS Book , 1995, Monographs in Visual Communication.

[4]  Nikos A. Aspragathos,et al.  Obstacle representation by Bump-surfaces for optimal motion-planning , 2005, Robotics Auton. Syst..

[5]  John N. Tsitsiklis,et al.  Special cases of traveling salesman and repairman problems with time windows , 1992, Networks.

[6]  Andreas C. Nearchou,et al.  Path planning of a mobile robot using genetic heuristics , 1998, Robotica.

[7]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[8]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[9]  Alain Pruski,et al.  Robust Path Planning for Non-Holonomic Robots , 1997, J. Intell. Robotic Syst..

[10]  Stavros G. Vougioukas,et al.  Optimization of Robot Paths Computed by Randomized Planners , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[11]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[12]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[13]  Nancy M. Amato,et al.  Randomized motion planning for car-like robots with C-PRM , 2001, Proceedings 2001 IEEE/RSJ International Conference on Intelligent Robots and Systems. Expanding the Societal Role of Robotics in the the Next Millennium (Cat. No.01CH37180).

[14]  P. Khosla,et al.  Artificial potentials with elliptical isopotential contours for obstacle avoidance , 1987, 26th IEEE Conference on Decision and Control.

[15]  Edward K. Baker,et al.  Technical Note - An Exact Algorithm for the Time-Constrained Traveling Salesman Problem , 1983, Oper. Res..

[16]  Daniel E. Koditschek,et al.  Exact robot navigation using artificial potential functions , 1992, IEEE Trans. Robotics Autom..

[17]  Iris F. A. Vis,et al.  Survey of research in the design and control of automated guided vehicle systems , 2006, Eur. J. Oper. Res..

[18]  Jean-Claude Latombe,et al.  Numerical potential field techniques for robot path planning , 1991, Fifth International Conference on Advanced Robotics 'Robots in Unstructured Environments.

[19]  Nikos A. Aspragathos,et al.  Time-optimal task scheduling for articulated manipulators in environments cluttered with obstacles , 2009, Robotica.

[20]  Ling Qiu,et al.  Scheduling and routing algorithms for AGVs: A survey , 2002 .

[21]  John T. Wen,et al.  A path space approach to nonholonomic motion planning in the presence of obstacles , 1997, IEEE Trans. Robotics Autom..