Methodology of Concept Control Synthesis to Avoid Unmoving and Moving Obstacles (II)

Dynamic path generation problem of robot in environment with other unmoving and moving objects is considered. Generally, the problem is known in literature as find path or robot motion planning. In this paper we apply the behavioral cloning approach to design the robot controller. In behavioral cloning, the system learns from control traces of a human operator. The task for the given problem is to find a controller not only in the form of the explicit mathematical expression. So RBF neural network is used also. The goal is to apply controller for the mobile robot motion planning in situation with infinite number of obstacles. The advantage of this approach lies in the fact that a complete path can be defined off-line, without using sophisticated symbolical models of obstacles.

[1]  Gordon T. Wilfong.  Motion planning in the presence of movable obstacles , 1988, SCG '88.

[2]  Daniel E. Koditschek,et al.  Exact robot navigation by means of potential functions: Some topological considerations , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.

[3]  Mahesan Niranjan,et al.  Neural networks and radial basis functions in classifying static speech patterns , 1990 .

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

[5]  M. Gerke,et al.  Genetic path planning for mobile robots , 1999, Proceedings of the 1999 American Control Conference (Cat. No. 99CH36251).

[6]  Donald Michie,et al.  Knowledge, Learning and Machine Intelligence , 1993 .

[7]  J. Ross Quinlan,et al.  Induction of Decision Trees , 1986, Machine Learning.

[8]  Vikram Kapila,et al.  Optimal path planning for unmanned air vehicles with kinematic and tactical constraints , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

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

[10]  Seth Hutchinson,et al.  An efficient hybrid planner in changing environments , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[11]  J. Schwartz,et al.  On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .

[12]  Toshio Fukuda,et al.  An intelligent robotic system based on a fuzzy approach , 1999, Proc. IEEE.

[13]  Jean-Claude Latombe,et al.  Robot Motion Planning: A Distributed Representation Approach , 1991, Int. J. Robotics Res..

[14]  Pang C. Chen.  Improving Path Planning with Learning , 1992, ML.

[15]  Micha Sharir,et al.  A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space , 2005, Algorithmica.

[16]  Jean-Daniel Boissonnat,et al.  A practical exact motion planning algorithm for polygonal object amidst polygonal obstacles , 1988, Geometry and Robotics.

[17]  Claude Sammut,et al.  Learning to Fly , 1992, ML.

[18]  Yong K. Hwang,et al.  Practical path planning among movable obstacles , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[19]  Ingrid Daubechies,et al.  Ten Lectures on Wavelets , 1992 .

[20]  J. Burdick,et al.  Sensor based planning. I. The generalized Voronoi graph , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[21]  John Canny,et al.  The complexity of robot motion planning , 1988 .

[22]  Mark H. Overmars,et al.  A probabilistic learning approach to motion planning , 1995 .

[23]  D. Broomhead,et al.  Radial Basis Functions, Multi-Variable Functional Interpolation and Adaptive Networks , 1988 .

[24]  F. Girosi,et al.  Networks for approximation and learning , 1990, Proc. IEEE.

[25]  Lydia E. Kavraki,et al.  Randomized preprocessing of configuration for fast path planning , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[26]  Seth Hutchinson,et al.  Efficient search and hierarchical motion planning by dynamically maintaining single-source shortest paths trees , 1995, IEEE Trans. Robotics Autom..

[27]  Seth Hutchinson,et al.  Efficient search and hierarchical motion planning using dynamic single-source shortest paths trees , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.

[28]  Micha Sharir,et al.  Motion Planning in the Presence of Moving Obstacles , 1985, FOCS.

[29]  C. Micchelli.  Interpolation of scattered data: Distance matrices and conditionally positive definite functions , 1986 .

[30]  Leo Breiman,et al.  Classification and Regression Trees , 1984 .

[31]  Elon Rimon,et al.  Construction of C-space roadmaps from local sensory data. What should the sensors look for? , 1994, Algorithmica.

[32]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

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

[34]  Dimitry Gorinevsky,et al.  Dynamic multiresolution route optimization for autonomous aircraft , 2001, Proceeding of the 2001 IEEE International Symposium on Intelligent Control (ISIC '01) (Cat. No.01CH37206).

[35]  Sukhan Lee,et al.  Multilayer feedforward potential function network , 1988, IEEE 1988 International Conference on Neural Networks.

[36]  Rui Camacho,et al.  Building symbolic representations of intuitive real-time skills from performance data , 1994, Machine Intelligence 13.

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

[38]  Jean-Claude Latombe,et al.  A Monte-Carlo algorithm for path planning with many degrees of freedom , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

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

[40]  James D. Keeler,et al.  Layered Neural Networks with Gaussian Hidden Units as Universal Approximations , 1990, Neural Computation.

[41]  Bruce Randall Donald,et al.  Simplified Voronoi diagrams , 1987, SCG '87.

[42]  Ranka Kulić.  Transfer of Skill in Obstacle Avoiding Domain , 2001 .

[43]  B. J. Driessen,et al.  Path planning for complex terrain navigation via dynamic programming , 1999, Proceedings of the 1999 American Control Conference (Cat. No. 99CH36251).

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

[45]  Micha Sharir,et al.  An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers (extended abstract) , 1985, SCG '85.

[46]  Mark H. Overmars,et al.  The Complexity of the Free Space for a Robot Moving Amidst Fat Obstacles , 1992, Comput. Geom..

[47]  Bernhard Glavina,et al.  Solving findpath by combination of goal-directed and randomized search , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[48]  Rodney A. Brooks,et al.  A subdivision algorithm in configuration space for findpath with rotation , 1983, IEEE Transactions on Systems, Man, and Cybernetics.