Interactive benchmark for planning algorithms on the Web: http:.//www.piaggio.ccii.unipi.it/benchplanning.html

This paper presents an interactive environment available on the WorldWide Web intended to allow fair and thorough comparison of different techniques to solve a basic problem in nonholonomic motion planning. By connecting to the server, the user, potentially unaware of the technical subtleties of the planning problem, but well conscious of his application needs, can design the benchmark problem that is most significant to his purposes. The user can then obtain different solutions from several algorithm providers, and compare them both qualitatively (by graphic display), and quantitatively. Providers implement their own algorithms at their sites, with wide freedom of choice in programming language, computational architecture, etc., while complying with few simple protocol conventions. It is believed that similar usage of the Web, easily extendable to other domains, can usefully contribute to the fair comparison of results among researchers, as well as to the diffusion of advanced research results towards application oriented users.

[1]  John F. Canny,et al.  Using skeletons for nonholonomic path planning among obstacles , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[2]  Jean-Daniel Boissonnat,et al.  Shortest paths of Bounded Curvature in the Plane , 1991, Geometric Reasoning for Perception and Action.

[3]  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.

[4]  Christian Laugier,et al.  Motion generation and control for parking an autonomous vehicle , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[5]  Jean-Claude Latombelatombe.  Ing of Connguration Space for Fast Path Planning , 2007 .

[6]  L. Dubins.  On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents , 1957 .

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

[8]  Antonio Bicchi,et al.  Planning shortest bounded-curvature paths for a class of nonholonomic vehicles among obstacles , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[9]  Antonio Bicchi,et al.  Planning shortest bounded-curvature paths for a class of nonholonomic vehicles among obstacles , 1996, J. Intell. Robotic Syst..

[10]  L. Shepp,et al.  OPTIMAL PATHS FOR A CAR THAT GOES BOTH FORWARDS AND BACKWARDS , 1990 .

[11]  J. Sussmann,et al.  SHORTEST PATHS FOR THE REEDS-SHEPP CAR: A WORKED OUT EXAMPLE OF THE USE OF GEOMETRIC TECHNIQUES IN NONLINEAR OPTIMAL CONTROL. 1 , 1991 .

[12]  Y. Kanayama,et al.  Smooth Local Path Planning for Autonomous Vehicles , 1990, Autonomous Robot Vehicles.

[13]  John F. Canny,et al.  Planning smooth paths for mobile robots , 1989, Proceedings, 1989 International Conference on Robotics and Automation.