{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T18:27:56Z","timestamp":1785608876426,"version":"3.56.0"},"reference-count":28,"publisher":"SAGE Publications","issue":"7","license":[{"start":{"date-parts":[[1998,7,1]],"date-time":"1998-07-01T00:00:00Z","timestamp":899251200000},"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":[[1998,7]]},"abstract":"<jats:p>This paper presents a method for robot motion planning in dynamic environments. It consists of selecting avoidance maneuvers to avoid static and moving obstacles in the velocity space, based on the cur rent positions and velocities of the robot and obstacles. It is a first- order method, since it does not integrate velocities to yield positions as functions of time.<\/jats:p>\n                  <jats:p>The avoidance maneuvers are generated by selecting robot ve locities outside of the velocity obstacles, which represent the set of robot velocities that would result in a collision with a given obstacle that moves at a given velocity, at some future time. To ensure that the avoidance maneuver is dynamically feasible, the set of avoidance velocities is intersected with the set of admissible velocities, defined by the robot's acceleration constraints. Computing new avoidance maneuvers at regular time intervals accounts for general obstacle trajectories.<\/jats:p>\n                  <jats:p>The trajectory from start to goal is computed by searching a tree of feasible avoidance maneuvers, computed at discrete time intervals. An exhaustive search of the tree yields near-optimal trajectories that either minimize distance or motion time. A heuristic search of the tree is applicable to on-line planning. The method is demonstrated for point and disk robots among static and moving obstacles, and for an automated vehicle in an intelligent vehicle highway system scenario.<\/jats:p>","DOI":"10.1177\/027836499801700706","type":"journal-article","created":{"date-parts":[[2007,3,11]],"date-time":"2007-03-11T03:05:13Z","timestamp":1173582313000},"page":"760-772","source":"Crossref","is-referenced-by-count":1634,"title":["Motion Planning in Dynamic Environments Using Velocity Obstacles"],"prefix":"10.1177","volume":"17","author":[{"given":"Paolo","family":"Fiorini","sequence":"first","affiliation":[{"name":"Jet Propulsion Laboratory California Institute of Technology Pasadena, California 91109 USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zvi","family":"Shiller","sequence":"additional","affiliation":[{"name":"Department of Mechanical, Nuclear, and Aerospace Engineering University of California, Los Angeles Los Angeles, California 90024 USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"179","published-online":{"date-parts":[[1998,7,1]]},"reference":[{"key":"atypb1","volume-title":"New lower bound techniques for robot motion planning problems. 28th IEEE Symp. on Found. of Comp. Sci","author":"Canny, J.","year":"1987"},{"issue":"4","key":"atypb2","first-page":"477","volume":"2","author":"Erdmann, M.","year":"1986","journal-title":"Algorithmica"},{"key":"atypb3","unstructured":"Featherstone, R. 1990. Swept bubbles: A method of representing swept volume and space occupancy. Technical Reports TR-90-024 and MS-90-069, Philips Laboratories, North American Philips Corporation, Briarcliff Manor , New York 10510."},{"key":"atypb4","volume-title":"Robot motion planning among moving obstacles. Ph.D. thesis","author":"Fiorini, P.","year":"1995"},{"key":"atypb5","unstructured":"Fiorini, P., and Shiller, Z. 1993. Motion planning in dynamic environments using the relative velocity paradigm. IEEE Int. Conf. of Automat. and Robotics , vol. 1. Los Alamitos, CA: IEEE, pp. 550-566."},{"key":"atypb6","doi-asserted-by":"crossref","unstructured":"Fiorini, P., and Shiller, Z. 1995. Robot motion planning in dynamic environments Int. Symp. of Robot. Res., eds. G. Girald, and G. Hirzinger. Munich, Germany: Springer-Verlag, pp. 237-248.","DOI":"10.1007\/978-1-4471-1021-7_27"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1996.506925"},{"issue":"2","key":"atypb8","first-page":"101","volume":"7","author":"Fiorini, P.","year":"1997","journal-title":"J. Appl. Math. and Comp. Sci."},{"key":"atypb9","first-page":"1393","author":"Fraichard, T.","year":"1993","journal-title":"IEEE\/RSJ Int. Conf. on Intell. Robots and Sys."},{"key":"atypb10","first-page":"40","volume":"1","author":"Fraichard, T.","year":"1993","journal-title":"IEEE Int. Conf. of Automat. and Robot"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1177\/027836499401300502"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1109\/70.388776"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1109\/70.88018"},{"key":"atypb14","doi-asserted-by":"crossref","unstructured":"Fujimura, K., and Samet, H. 1989b (Scottsdale, AZ). Time-minimal paths among moving obstacles. IEEE Int. Conf. on Robot. and Automat Los Alamitos, CA : IEEE, pp.1110-1115.","DOI":"10.1109\/ROBOT.1989.100129"},{"key":"atypb15","doi-asserted-by":"crossref","unstructured":"Fujiimura, K., and Samet, H. 1990 (Cincinnati, OH). Motion planning in a dynamic domain. IEEE Int. Conf. on Robot. and Automat Los Alamitos, CA : IEEE, pp. 324-330.","DOI":"10.1109\/ROBOT.1990.125996"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1007\/BF01908631"},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1177\/027836499501400203"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1177\/027836498600500304"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(85)90084-0"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1987.289330"},{"key":"atypb21","volume-title":"Principles of Artificial Intelligence","author":"Nilsson, X.","year":"1980"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1979.4766925"},{"key":"atypb23","volume-title":"Heuristics","author":"Pearl, J.","year":"1985"},{"key":"atypb24","first-page":"144","author":"Reif, J.","year":"1985","journal-title":"25th IEEE Symp. on the Found. of Comp. Sci."},{"key":"atypb25","doi-asserted-by":"publisher","DOI":"10.1145\/179812.179911"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1016\/0954-1810(88)90025-8"},{"key":"atypb27","unstructured":"Shiller, Z., and Sundar, S. 1996 (San Francisco, CA). Emergency maneuvers of autonomous vehicles The 13th World Congress, IFAC9U, vol. Q, pp. 393-398."},{"key":"atypb28","first-page":"2470","author":"Tsubouchi, T.","year":"1994","journal-title":"IEEE Conf. on Robot. and Automat."}],"container-title":["The International Journal of Robotics Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/027836499801700706","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/027836499801700706","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T10:15:40Z","timestamp":1777457740000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/027836499801700706"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,7]]},"references-count":28,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1998,7]]}},"alternative-id":["10.1177\/027836499801700706"],"URL":"https:\/\/doi.org\/10.1177\/027836499801700706","relation":{},"ISSN":["0278-3649","1741-3176"],"issn-type":[{"value":"0278-3649","type":"print"},{"value":"1741-3176","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,7]]}}}