DYNORA: A real-time planning algorithm to meet response-time constraints in dynamic environments

Babak Hamidzadeh, Shashi Shekhar

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

1 Scopus citations

Abstract

Most real-time planning algorithms address either the issue of response-time constraints or the issue of dynamic environments. A new real-time planning algorithm, DYNORA, is proposed to address both of these issues simultaneously. DYNORA is structured as a sequence of partial planning and execution cycles to avoid obsolescence of planning solutions at the time of execution. DYNORA uses a stopping criterion to balance planning cost and execution cost to achieve near optimal response times. DYNORA was used for the routing problem to optimize total cost. It shows better average-case time complexity than traditional real-time algorithms.

Original languageEnglish (US)
Title of host publicationThird Int Conf Tools Artif Intell
PublisherPubl by IEEE
Pages228-235
Number of pages8
ISBN (Print)0818623004
StatePublished - Jan 1 1992
EventThird International Conference on Tools for Artificial Intelligence - San Jose, CA, USA
Duration: Nov 5 1991Nov 8 1991

Publication series

NameThird Int Conf Tools Artif Intell

Other

OtherThird International Conference on Tools for Artificial Intelligence
CitySan Jose, CA, USA
Period11/5/9111/8/91

Fingerprint Dive into the research topics of 'DYNORA: A real-time planning algorithm to meet response-time constraints in dynamic environments'. Together they form a unique fingerprint.

Cite this