Trajectory planning on grids: Considering speed limit constraints

Lukáš Chrpa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

Trajectory (path) planning is a well known and thoroughly studied field of automated planning. It is usually used in computer games, robotics or autonomous agent simulations. Grids are often used for regular discretization of continuous space. Many methods exist for trajectory (path) planning on grids, we address the well known A* algorithm and the state-of-the-art Theta* algorithm. Theta* algorithm, as opposed to A*, provides 'any-angle' paths that look more realistic. In this paper, we provide an extension of both these algorithms to enable support for speed limit constraints. We experimentally evaluate and thoroughly discuss how the extensions affect the planning process showing reasonability and justification of our approach.

Original languageEnglish
Title of host publicationEleventh Scandinavian Conference on Artificial Intelligence
PublisherIOS Press
Pages60-69
Number of pages10
Volume227
ISBN (Print)9781607507536
DOIs
Publication statusPublished - 2011
Externally publishedYes

Publication series

NameFrontiers in Artificial Intelligence and Applications
Volume227
ISSN (Print)09226389

Fingerprint Dive into the research topics of 'Trajectory planning on grids: Considering speed limit constraints'. Together they form a unique fingerprint.

Cite this