{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T01:02:12Z","timestamp":1779238932647,"version":"3.51.4"},"reference-count":45,"publisher":"SAGE Publications","issue":"6","license":[{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The International Journal of Robotics Research"],"published-print":{"date-parts":[[1991,12]]},"abstract":"<jats:p>We propose a new approach to robot path planning that consists of building and searching a graph connecting the local minima of a potential function defined over the robot's configuration space. A planner based on this approach has been implemented. This planner is consider ably faster than previous path planners and solves prob lems for robots with many more degrees of freedom (DOFs). The power of the planner derives both from the \"good\" properties of the potential function and from the efficiency of the techniques used to escape the local min ima of this function. The most powerful of these tech niques is a Monte Carlo technique that escapes local min ima by executing Brownian motions. The overall approach is made possible by the systematic use of distributed rep resentations (bitmaps) for the robot's work space and configuration space. We have experimented with the plan ner using several computer-simulated robots, including rigid objects with 3 DOFs (in 2D work space) and 6 DOFs (in 3D work space) and manipulator arms with 8, 10, and 31 DOFs (in 2D and 3D work spaces). Some of the most significant experiments are reported in this article.<\/jats:p>","DOI":"10.1177\/027836499101000604","type":"journal-article","created":{"date-parts":[[2007,3,4]],"date-time":"2007-03-04T20:24:06Z","timestamp":1173039846000},"page":"628-649","source":"Crossref","is-referenced-by-count":658,"title":["Robot Motion Planning: A Distributed Representation Approach"],"prefix":"10.1177","volume":"10","author":[{"given":"J\u00e9r\u00f4me","family":"Barraquand","sequence":"first","affiliation":[{"name":"Robotics Laboratory Department of Computer Science Stanford University Stanford, California 94305"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Claude","family":"Latombe","sequence":"additional","affiliation":[{"name":"Robotics Laboratory Department of Computer Science Stanford University Stanford, California 94305"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[1991,12,1]]},"reference":[{"key":"atypb1","volume-title":"Data Structures and Algorithms","author":"Aho, A.V.","year":"1983"},{"key":"atypb2","unstructured":"Alami, R., Sim\u00e9on, T., and Laumond, J.P. 1989. A geometrical approach to planning manipulation tasks\u2014the case of discrete placements and grasps. In Miura, H., and Arimoto, S. (eds.): Robotics Research 5. Cambridge, MA: MIT Press, pp. 453-463."},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1017\/S0027763000017232"},{"issue":"4","key":"atypb4","volume":"2","author":"Barnard, S.T.","year":"1988","journal-title":"Computer Vision"},{"key":"atypb5","volume-title":"Markovian random fields in computer vision: Applications to seismic data understanding","author":"Barraquand, J.","year":"1988"},{"key":"atypb6","unstructured":"Barraquand, J., Langlois, B., and Latombe, J.C. 1989. Robot motion planning with many degrees of freedom and dynamic constraints. In Miura, H., and Arimoto, S. (eds.): Robotics Research 5. Cambridge, MA: MIT Press , pp. 435-444."},{"key":"atypb7","volume-title":"Proc. of the 4th IEEE Int. Symp. on Intelligent Control","author":"Barraquand, J."},{"key":"atypb8","volume-title":"Robot Motion Planning: A Distributed Representation Approach. Report no. STAN-CS-89-1257","author":"Barraquand, J.","year":"1989"},{"key":"atypb9","volume-title":"Controllability of mobile robots with kinematic constraints. Rep. no. STAN-CS-90-1317. Dept. of Computer Science","author":"Barraquand, J.","year":"1990"},{"key":"atypb10","volume-title":"Proc. of the 8th Int. Joint Conf. on Artificial Intelligence","author":"Brooks, R.A."},{"key":"atypb11","volume-title":"The Complexity of Robot Motion Planning","author":"Canny, J.F.","year":"1988"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1007\/BF00940812"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.21236\/ADA181538"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.21236\/ADA196213"},{"key":"atypb15","volume-title":"Proc. of the IEEE Int. Conf. on Robotics and Automation","author":"Faverjon, B."},{"key":"atypb16","volume-title":"Proc. of the IEEE Int. Conf. on Robotics and Automation","author":"Faverjon, B."},{"key":"atypb17","volume-title":"Proc. of the IEEE Int. Conf. on Automation and Robotics","author":"Faverjon, B."},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1984.4767596"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1137\/0324060"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1177\/027836498400300403"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1177\/027836498600500304"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1177\/027836498600500106"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"atypb24","volume-title":"Proc. of the IEEE Int. Conf. on Robotics and Automation","author":"Koditschek, D.E."},{"key":"atypb25","volume-title":"Robot Motion Planning","author":"Latombe, J.C.","year":"1990"},{"key":"atypb26","author":"Laugier, C.","year":"1985","journal-title":"Int. Conf. on Advanced Robotics."},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1137\/0210006"},{"key":"atypb28","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1983.1676196"},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1109\/JRA.1987.1087095"},{"key":"atypb30","volume-title":"Proc. of the 26th IEEE Conf. on Decision and Control","author":"Lumelsky, V."},{"key":"atypb31","volume-title":"Run-time statistical analysis of a robot motion planning algorithm. Internal technical note. Robotics Laboratory, Dept. of Computer Science","author":"M\u00e9tivier, C.","year":"1990"},{"key":"atypb32","volume-title":"Principles of Artificial Intelligence","author":"Nilsson, N.J.","year":"1980"},{"key":"atypb33","volume-title":"Proc. of the IEEE Int. Conf. on Robotics and Automation","author":"O'Donnell, P.A."},{"key":"atypb34","volume-title":"Proc. of the 15th ACM Symp. on the Theory of Computing","author":"\u00d3'D\u00fanlaing, C."},{"key":"atypb35","volume-title":"Probability, Random Variables, and Stochastic Processes","author":"Papoulis, A.","year":"1965"},{"key":"atypb36","first-page":"421","author":"Reif, J.H.","year":"1979","journal-title":"Science"},{"key":"atypb37","volume-title":"Proc. of the IEEE Int. Conf. on Robotics and Automation","author":"Rimon, E."},{"key":"atypb38","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.3160360305"},{"key":"atypb39","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(83)90014-3"},{"key":"atypb40","doi-asserted-by":"publisher","DOI":"10.1177\/027836498300200304"},{"key":"atypb41","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(88)90053-7"},{"key":"atypb42","volume-title":"Planning, Geometry, and Complexity of Robot Motion","author":"Schwartz, J.T.","year":"1987"},{"key":"atypb43","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-1697-8"},{"key":"atypb44","volume-title":"Image Analysis and Mathematical Morphology","author":"Serra, J.","year":"1982"},{"key":"atypb45","volume-title":"New heuristic algorithms for efficient hierarchical path planning. Rep. no. STAN-CS-89-1279. Dept. of Computer Science","author":"Zhu, D.","year":"1989"}],"container-title":["The International Journal of Robotics Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/027836499101000604","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/027836499101000604","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T10:14:22Z","timestamp":1777457662000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/027836499101000604"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":45,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["10.1177\/027836499101000604"],"URL":"https:\/\/doi.org\/10.1177\/027836499101000604","relation":{},"ISSN":["0278-3649","1741-3176"],"issn-type":[{"value":"0278-3649","type":"print"},{"value":"1741-3176","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}