Integration of the artificial potential field approach with simulated annealing for robot path planning
暂无分享,去创建一个
[1] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.
[2] D. Mitra,et al. Convergence and finite-time behavior of simulated annealing , 1986, Advances in Applied Probability.
[3] 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.
[4] Masatoshi Okutomi,et al. Decision of robot movement by means of a potential field , 1986, Adv. Robotics.
[5] Bernard Espiau. Use of optical reflectance sensors , 1985 .
[6] V. Cerný. Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .
[7] Charles W. Warren,et al. Global path planning using artificial potential fields , 1989, Proceedings, 1989 International Conference on Robotics and Automation.
[8] Oussama Khatib,et al. Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1986 .
[9] Bernhard Glavina,et al. Solving findpath by combination of goal-directed and randomized search , 1990, Proceedings., IEEE International Conference on Robotics and Automation.
[10] S Webb,et al. SPECT reconstruction by simulated annealing. , 1989 .
[11] Donald Geman,et al. Boundary Detection by Constrained Optimization , 1990, IEEE Trans. Pattern Anal. Mach. Intell..
[12] Daniel E. Koditschek,et al. Exact robot navigation in geometrically complicated but topologically simple spaces , 1990, Proceedings., IEEE International Conference on Robotics and Automation.
[13] Pradeep K. Khosla,et al. Superquadric artificial potentials for obstacle avoidance and approach , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.
[14] Scott Kirkpatrick,et al. Global Wiring by Simulated Annealing , 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[15] Tomás Lozano-Pérez,et al. An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.
[16] Donald Geman,et al. Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[17] Jean-Claude Latombe,et al. Numerical potential field techniques for robot path planning , 1991, Fifth International Conference on Advanced Robotics 'Robots in Unstructured Environments.
[18] Jean-Claude Latombe,et al. Robot Motion Planning: A Distributed Representation Approach , 1991, Int. J. Robotics Res..
[19] C C Guest,et al. Simulated annealing algorithm for binary phase only filters in pattern classification. , 1990, Applied optics.
[20] Jean-Daniel Boissonnat,et al. A practical exact motion planning algorithm for polygonal object amidst polygonal obstacles , 1988, Geometry and Robotics.
[21] Daniel E. Koditschek,et al. The construction of analytic diffeomorphisms for exact robot navigation on star worlds , 1989, Proceedings, 1989 International Conference on Robotics and Automation.
[22] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[23] Cecilia R. Aragon,et al. Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..
[24] Pradeep K. Khosla,et al. Manipulator control with superquadric artificial potential functions: theory and experiments , 1990, IEEE Trans. Syst. Man Cybern..