Adaptive path planner for highly dynamic environments

Jacky Baltes, Nicholas Hildreth

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

10 Citations (Scopus)

Abstract

This paper describes adaptive path planning, a novel approach to path planning for car-like mobile robots. Instead of creating a new plan from scratch, whenever changes in the environment invalidate the current plan, the adaptive path planner attempts to adapt the old plan to the new situation. The paper proposes an efficient representation for path that is easily amendable to adaptation. Associated with the path planner is a set of repair strategies. These repair strategies are local methods to fix a plan to compensate for object movement in the domain. The repair strategies are specific and have a high probability of being able to fix a plan. An empirical evaluation shows that adaptive path planning is suitable to highly dynamic domains, such as RoboCup. Adaptive path planning reduces the cumulative planning time by a factor of 2:7 compared to Bicchi's planner. At the same time, the quality of the plans generated by the adaptive path planner were similar to those generated by Bicchi's planner.

Original languageEnglish
Title of host publicationRoboCup 2000
Subtitle of host publicationRobot Soccer World Cup IV
Pages76-85
Number of pages10
Publication statusPublished - 2001 Dec 1
Event4th Robot World Cup Soccer Games and Conferences, RoboCup 2000 - Melbourne, VIC, Australia
Duration: 2000 Aug 272000 Sep 3

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2019 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other4th Robot World Cup Soccer Games and Conferences, RoboCup 2000
CountryAustralia
CityMelbourne, VIC
Period00/8/2700/9/3

Fingerprint

Dynamic Environment
Motion planning
Path Planning
Path
Repair
Mobile robots
Railroad cars
Planning
Mobile Robot
Evaluation
Strategy

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Baltes, J., & Hildreth, N. (2001). Adaptive path planner for highly dynamic environments. In RoboCup 2000: Robot Soccer World Cup IV (pp. 76-85). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2019 LNAI).

Adaptive path planner for highly dynamic environments. / Baltes, Jacky; Hildreth, Nicholas.

RoboCup 2000: Robot Soccer World Cup IV. 2001. p. 76-85 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2019 LNAI).

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

Baltes, J & Hildreth, N 2001, Adaptive path planner for highly dynamic environments. in RoboCup 2000: Robot Soccer World Cup IV. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2019 LNAI, pp. 76-85, 4th Robot World Cup Soccer Games and Conferences, RoboCup 2000, Melbourne, VIC, Australia, 00/8/27.
Baltes J, Hildreth N. Adaptive path planner for highly dynamic environments. In RoboCup 2000: Robot Soccer World Cup IV. 2001. p. 76-85. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Baltes, Jacky ; Hildreth, Nicholas. / Adaptive path planner for highly dynamic environments. RoboCup 2000: Robot Soccer World Cup IV. 2001. pp. 76-85 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{1e61f436fc6549e388ecb1545cee548a,
title = "Adaptive path planner for highly dynamic environments",
abstract = "This paper describes adaptive path planning, a novel approach to path planning for car-like mobile robots. Instead of creating a new plan from scratch, whenever changes in the environment invalidate the current plan, the adaptive path planner attempts to adapt the old plan to the new situation. The paper proposes an efficient representation for path that is easily amendable to adaptation. Associated with the path planner is a set of repair strategies. These repair strategies are local methods to fix a plan to compensate for object movement in the domain. The repair strategies are specific and have a high probability of being able to fix a plan. An empirical evaluation shows that adaptive path planning is suitable to highly dynamic domains, such as RoboCup. Adaptive path planning reduces the cumulative planning time by a factor of 2:7 compared to Bicchi's planner. At the same time, the quality of the plans generated by the adaptive path planner were similar to those generated by Bicchi's planner.",
author = "Jacky Baltes and Nicholas Hildreth",
year = "2001",
month = "12",
day = "1",
language = "English",
isbn = "3540421858",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "76--85",
booktitle = "RoboCup 2000",

}

TY - GEN

T1 - Adaptive path planner for highly dynamic environments

AU - Baltes, Jacky

AU - Hildreth, Nicholas

PY - 2001/12/1

Y1 - 2001/12/1

N2 - This paper describes adaptive path planning, a novel approach to path planning for car-like mobile robots. Instead of creating a new plan from scratch, whenever changes in the environment invalidate the current plan, the adaptive path planner attempts to adapt the old plan to the new situation. The paper proposes an efficient representation for path that is easily amendable to adaptation. Associated with the path planner is a set of repair strategies. These repair strategies are local methods to fix a plan to compensate for object movement in the domain. The repair strategies are specific and have a high probability of being able to fix a plan. An empirical evaluation shows that adaptive path planning is suitable to highly dynamic domains, such as RoboCup. Adaptive path planning reduces the cumulative planning time by a factor of 2:7 compared to Bicchi's planner. At the same time, the quality of the plans generated by the adaptive path planner were similar to those generated by Bicchi's planner.

AB - This paper describes adaptive path planning, a novel approach to path planning for car-like mobile robots. Instead of creating a new plan from scratch, whenever changes in the environment invalidate the current plan, the adaptive path planner attempts to adapt the old plan to the new situation. The paper proposes an efficient representation for path that is easily amendable to adaptation. Associated with the path planner is a set of repair strategies. These repair strategies are local methods to fix a plan to compensate for object movement in the domain. The repair strategies are specific and have a high probability of being able to fix a plan. An empirical evaluation shows that adaptive path planning is suitable to highly dynamic domains, such as RoboCup. Adaptive path planning reduces the cumulative planning time by a factor of 2:7 compared to Bicchi's planner. At the same time, the quality of the plans generated by the adaptive path planner were similar to those generated by Bicchi's planner.

UR - http://www.scopus.com/inward/record.url?scp=84867461089&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84867461089&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84867461089

SN - 3540421858

SN - 9783540421856

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 76

EP - 85

BT - RoboCup 2000

ER -