This Article Full Text (PDF) References Alert me when this article is cited Alert me if a correction is posted Services Email this article to a friend Similar articles in this journal Alert me to new issues of the journal Add to Saved Citations Download to citation manager Request Permissions Request Reprints Add to My Marked Citations Citing Articles Citing Articles via Google Scholar Citing Articles via Scopus Google Scholar Articles by Fujimura, K. Search for Related Content Social Bookmarking                         What's this?

Motion Planning Amid Transient Obstacles

Department of Computer and Information Science The Ohio State University Columbus, Ohio 43210

Motion planning in the presence of time-dependent obstacles is studied. Many of the prior approaches to motion planning problems assume that the obstacles always exist in the environ ment, whether they are stationary or in motion. In this article, I consider the case that the environment contains obstacles whose existing periods are dependent on time (i.e., they can appear and disappear in the environment). This formulation allows us to model a variety of time-varying situations that can arise in application domains. A concept similar to that of visibility is used to solve the problem. An algorithm is pre sented to generate a motion in such a dynamic domain, its time-minimality is proved, and computation time is analyzed.

The International Journal of Robotics Research, Vol. 13, No. 5, 395-407 (1994)
DOI: 10.1177/027836499401300502


CiteULike    Complore    Connotea    Del.icio.us    Digg    Reddit    Technorati    Twitter    What's this?