{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T10:06:36Z","timestamp":1777716396968,"version":"3.51.4"},"reference-count":31,"publisher":"SAGE Publications","issue":"9-10","license":[{"start":{"date-parts":[[2013,8,1]],"date-time":"2013-08-01T00:00:00Z","timestamp":1375315200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["The International Journal of Robotics Research"],"published-print":{"date-parts":[[2013,8]]},"abstract":"<jats:p>This paper presents an efficient algorithm for online avoidance of static obstacles that accounts for robot dynamics and actuator constraints. The robot trajectory (path and speed) is generated incrementally by avoiding obstacles optimally one at a time, thus reducing the original problem from one that avoids m obstacles to m simpler problems that avoid one obstacle each. The computational complexity of this planner is therefore linear in the number of obstacles, instead of the typical exponential complexity of traditional geometric planners. This approach is quite general and applicable to any cost function and to any robot dynamics; it is treated here for minimum time motions, a planar point mass robot, and circular obstacles. Numerical experiments demonstrate the algorithm for very cluttered environments (70 obstacles) and narrow passages. Upper and lower bounds on the motion time and on the path length were derived as functions of the Euclidean distance between the end points and the average obstacle size. Comparing a kinematic version of this algorithm to the RRT and RRT* planners showed significant advantages over both planners. The algorithm was demonstrated on an experimental mobile robot moving at high speeds in a known environment.<\/jats:p>","DOI":"10.1177\/0278364913489360","type":"journal-article","created":{"date-parts":[[2013,9,13]],"date-time":"2013-09-13T10:30:09Z","timestamp":1379068209000},"page":"1030-1047","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":19,"title":["Online obstacle avoidance at high speeds"],"prefix":"10.1177","volume":"32","author":[{"given":"Zvi","family":"Shiller","sequence":"first","affiliation":[{"name":"Department of Mechanical Engineering and Mechatronics, Ariel University, Israel"}]},{"given":"Sanjeev","family":"Sharma","sequence":"additional","affiliation":[{"name":"Department of Mechanical Engineering and Mechatronics, Ariel University, Israel"}]},{"given":"Ishai","family":"Stern","sequence":"additional","affiliation":[{"name":"Department of Mechanical Engineering and Mechatronics, Ariel University, Israel"}]},{"given":"Asher","family":"Stern","sequence":"additional","affiliation":[{"name":"Department of Mechanical Engineering and Mechatronics, Ariel University, Israel"}]}],"member":"179","published-online":{"date-parts":[[2013,9,13]]},"reference":[{"key":"bibr1-0278364913489360","volume-title":"Optimal Control: An Introduction to the Theory and its Applications","author":"Athans M","year":"1965"},{"key":"bibr2-0278364913489360","doi-asserted-by":"publisher","DOI":"10.1177\/027836498500400301"},{"key":"bibr3-0278364913489360","volume-title":"Applied Optimal Control","author":"Bryson A","year":"1969"},{"key":"bibr4-0278364913489360","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-8165-5"},{"key":"bibr5-0278364913489360","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1989.100104"},{"key":"bibr6-0278364913489360","volume-title":"Dynamic Programming and the Calculus of Variations","author":"Dreyfus S","year":"1965"},{"key":"bibr7-0278364913489360","doi-asserted-by":"publisher","DOI":"10.1163\/1568553042674662"},{"key":"bibr8-0278364913489360","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1986.1104333"},{"key":"bibr9-0278364913489360","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.1985.268837"},{"key":"bibr10-0278364913489360","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"bibr11-0278364913489360","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2012.6225235"},{"key":"bibr12-0278364913489360","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980479"},{"key":"bibr13-0278364913489360","doi-asserted-by":"publisher","DOI":"10.1115\/1.3426492"},{"key":"bibr14-0278364913489360","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2009.5152696"},{"key":"bibr15-0278364913489360","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2008.4651075"},{"key":"bibr16-0278364913489360","doi-asserted-by":"publisher","DOI":"10.1177\/02783640122067453"},{"key":"bibr17-0278364913489360","volume-title":"Foundations of Optimal Control Theory","author":"Lee EB","year":"1967"},{"issue":"185","key":"bibr18-0278364913489360","first-page":"1853","volume":"4","author":"Moskalenko AI","year":"1967","journal-title":"Automation and Remote Control"},{"key":"bibr19-0278364913489360","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-9438-9"},{"key":"bibr20-0278364913489360","volume-title":"Real Analysis","author":"Royden H","year":"1988","edition":"3"},{"key":"bibr21-0278364913489360","doi-asserted-by":"publisher","DOI":"10.23919\/ACC.2004.1384742"},{"key":"bibr22-0278364913489360","doi-asserted-by":"publisher","DOI":"10.1177\/02783640022066987"},{"key":"bibr23-0278364913489360","doi-asserted-by":"publisher","DOI":"10.1177\/027836498900800601"},{"key":"bibr24-0278364913489360","doi-asserted-by":"publisher","DOI":"10.1109\/70.105387"},{"key":"bibr25-0278364913489360","doi-asserted-by":"publisher","DOI":"10.1109\/70.75906"},{"key":"bibr26-0278364913489360","doi-asserted-by":"publisher","DOI":"10.1115\/1.2896505"},{"key":"bibr27-0278364913489360","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1985.1104009"},{"key":"bibr28-0278364913489360","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2012.2205651"},{"key":"bibr29-0278364913489360","unstructured":"Sundar S (1994) Near-optimal feedback control of robotic manipulators. PhD Thesis, University of California, USA."},{"key":"bibr30-0278364913489360","doi-asserted-by":"publisher","DOI":"10.1109\/70.563653"},{"key":"bibr31-0278364913489360","doi-asserted-by":"publisher","DOI":"10.2514\/6.2008-7132"}],"container-title":["The International Journal of Robotics Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0278364913489360","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0278364913489360","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T10:18:14Z","timestamp":1777457894000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/0278364913489360"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8]]},"references-count":31,"journal-issue":{"issue":"9-10","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["10.1177\/0278364913489360"],"URL":"https:\/\/doi.org\/10.1177\/0278364913489360","relation":{},"ISSN":["0278-3649","1741-3176"],"issn-type":[{"value":"0278-3649","type":"print"},{"value":"1741-3176","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8]]}}}