Optimal path-planning under finite memory obstacle dynamics based on probabilistic finite state automata models

Ishanu Chattopadhyay, Asok Ray

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

2 Citations (Scopus)

Abstract

The v*-planning algorithm is generalized to handle finite memory obstacle dynamics. A sufficiently long observation sequence of obstacle dynamics is algorithmically compressed via Symbolic Dynamic Filtering to obtain a probabilistic finite state model which is subsequently integrated with the navigation automaton to generate an overall model reflecting both navigation constraints and obstacle dynamics. A v*-based solution then yields a deterministic plan that maximizes the difference of the probabilities of reaching the goal and of hitting an obstacle. The approach is validated by simulated solution of dynamic mazes.

Original languageEnglish (US)
Title of host publication2009 American Control Conference, ACC 2009
Pages2403-2408
Number of pages6
DOIs
StatePublished - Nov 23 2009
Event2009 American Control Conference, ACC 2009 - St. Louis, MO, United States
Duration: Jun 10 2009Jun 12 2009

Publication series

NameProceedings of the American Control Conference
ISSN (Print)0743-1619

Other

Other2009 American Control Conference, ACC 2009
CountryUnited States
CitySt. Louis, MO
Period6/10/096/12/09

Fingerprint

Finite automata
Motion planning
Data storage equipment
Navigation
Planning

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

Chattopadhyay, I., & Ray, A. (2009). Optimal path-planning under finite memory obstacle dynamics based on probabilistic finite state automata models. In 2009 American Control Conference, ACC 2009 (pp. 2403-2408). [5160369] (Proceedings of the American Control Conference). https://doi.org/10.1109/ACC.2009.5160369
Chattopadhyay, Ishanu ; Ray, Asok. / Optimal path-planning under finite memory obstacle dynamics based on probabilistic finite state automata models. 2009 American Control Conference, ACC 2009. 2009. pp. 2403-2408 (Proceedings of the American Control Conference).
@inproceedings{28a245a3f69b4e1585609ccbf89f4f0d,
title = "Optimal path-planning under finite memory obstacle dynamics based on probabilistic finite state automata models",
abstract = "The v*-planning algorithm is generalized to handle finite memory obstacle dynamics. A sufficiently long observation sequence of obstacle dynamics is algorithmically compressed via Symbolic Dynamic Filtering to obtain a probabilistic finite state model which is subsequently integrated with the navigation automaton to generate an overall model reflecting both navigation constraints and obstacle dynamics. A v*-based solution then yields a deterministic plan that maximizes the difference of the probabilities of reaching the goal and of hitting an obstacle. The approach is validated by simulated solution of dynamic mazes.",
author = "Ishanu Chattopadhyay and Asok Ray",
year = "2009",
month = "11",
day = "23",
doi = "10.1109/ACC.2009.5160369",
language = "English (US)",
isbn = "9781424445240",
series = "Proceedings of the American Control Conference",
pages = "2403--2408",
booktitle = "2009 American Control Conference, ACC 2009",

}

Chattopadhyay, I & Ray, A 2009, Optimal path-planning under finite memory obstacle dynamics based on probabilistic finite state automata models. in 2009 American Control Conference, ACC 2009., 5160369, Proceedings of the American Control Conference, pp. 2403-2408, 2009 American Control Conference, ACC 2009, St. Louis, MO, United States, 6/10/09. https://doi.org/10.1109/ACC.2009.5160369

Optimal path-planning under finite memory obstacle dynamics based on probabilistic finite state automata models. / Chattopadhyay, Ishanu; Ray, Asok.

2009 American Control Conference, ACC 2009. 2009. p. 2403-2408 5160369 (Proceedings of the American Control Conference).

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

TY - GEN

T1 - Optimal path-planning under finite memory obstacle dynamics based on probabilistic finite state automata models

AU - Chattopadhyay, Ishanu

AU - Ray, Asok

PY - 2009/11/23

Y1 - 2009/11/23

N2 - The v*-planning algorithm is generalized to handle finite memory obstacle dynamics. A sufficiently long observation sequence of obstacle dynamics is algorithmically compressed via Symbolic Dynamic Filtering to obtain a probabilistic finite state model which is subsequently integrated with the navigation automaton to generate an overall model reflecting both navigation constraints and obstacle dynamics. A v*-based solution then yields a deterministic plan that maximizes the difference of the probabilities of reaching the goal and of hitting an obstacle. The approach is validated by simulated solution of dynamic mazes.

AB - The v*-planning algorithm is generalized to handle finite memory obstacle dynamics. A sufficiently long observation sequence of obstacle dynamics is algorithmically compressed via Symbolic Dynamic Filtering to obtain a probabilistic finite state model which is subsequently integrated with the navigation automaton to generate an overall model reflecting both navigation constraints and obstacle dynamics. A v*-based solution then yields a deterministic plan that maximizes the difference of the probabilities of reaching the goal and of hitting an obstacle. The approach is validated by simulated solution of dynamic mazes.

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

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

U2 - 10.1109/ACC.2009.5160369

DO - 10.1109/ACC.2009.5160369

M3 - Conference contribution

AN - SCOPUS:70449644252

SN - 9781424445240

T3 - Proceedings of the American Control Conference

SP - 2403

EP - 2408

BT - 2009 American Control Conference, ACC 2009

ER -

Chattopadhyay I, Ray A. Optimal path-planning under finite memory obstacle dynamics based on probabilistic finite state automata models. In 2009 American Control Conference, ACC 2009. 2009. p. 2403-2408. 5160369. (Proceedings of the American Control Conference). https://doi.org/10.1109/ACC.2009.5160369