Student or educator? Sign up with your school email and get 6 months of Pro free.

The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.

Motion Planning in Dynamic Environments Using Velocity Obstacles

Fiorini, Paolo, Shiller, Zvi·1998·The International Journal of Robotics Research

Abstract

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. 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. 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.

Overview

Integrity signals

Registry

Crossref · 10.1177/027836499801700706

Cites

27 of 27 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 27 references

Research works printed but not linked: 8

  1. Erdmann, M., 1986, Algorithmica, 2, 477
  2. Fiorini, P., 1995, Robot motion planning among moving obstacles. Ph.D. thesis
  3. Fiorini, P., 1997, J. Appl. Math. and Comp. Sci., 7, 101
  4. Fraichard, T., 1993, IEEE/RSJ Int. Conf. on Intell. Robots and Sys., 1393
  5. Fraichard, T., 1993, IEEE Int. Conf. of Automat. and Robot, 1, 40
  6. Pearl, J., 1985, Heuristics
  7. Reif, J., 1985, 25th IEEE Symp. on the Found. of Comp. Sci., 144
  8. Tsubouchi, T., 1994, IEEE Conf. on Robot. and Automat., 2470

Cited by

See all 2,008

Metadata

Authors
Fiorini, P., & Shiller, Z.
Affiliations
  • Jet Propulsion Laboratory (US)
  • University of California, Los Angeles (US)
Venue
The International Journal of Robotics Research
Published
1998-07
Volume
17
Issue
7
Pages
760-772
ISSN
  • 0278-3649 (ISSN-L)
  • 1741-3176
OpenAlex
W2002440441
Cited by
2,008
References
27
Citations by year
2026: 125 · 2025: 149 · 2024: 143 · 2023: 138 · 2022: 143 · 2021: 140 · 2020: 134 · 2019: 111 · 2018: 121 · 2017: 97 · 2016: 86 · 2015: 97 · 2014: 93 · 2013: 85 · 2012: 71
FWCI
8.25
Type
journal article
Language
en
Open access
closed
Licence
journals.sagepub.com/page/policies/text-and-data-mining-license (tdm)
Locations
The International Journal of Robotics Research (publishedVersion)
Funders
Jet Propulsion Laboratory
Topics
  • Physical Sciences › Engineering › Control and Systems Engineering › Robotic Path Planning Algorithms
  • Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
  • Physical Sciences › Engineering › Control and Systems Engineering › Control and Dynamics of Mobile Robots
Keywords
robot motion planning, dynamic environments, velocity obstacle, collision avoidance, dynamic obstacles, velocity space, acceleration constraints, tree search, heuristic search, online planning, point robot, autonomous vehicles, intelligent transportation systems

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Motion Planning in Dynamic Environments Using Velocity Obstacles. https://app.cochat.ai/papers/10.1177/027836499801700706
The paper
Fiorini, P., & Shiller, Z. (1998). Motion Planning in Dynamic Environments Using Velocity Obstacles. The International Journal of Robotics Research. https://doi.org/10.1177/027836499801700706

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.