Paper Info
Title
DYNORA: a real-time planning algorithm to meet response-time constraints in dynamic environments
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
Year
DOI
Venue
1991
10.1109/TAI.1991.167099
San Jose, CA
Keywords
Field
DocType
cognitive systems,computational complexity,planning (artificial intelligence),dynora,average-case time complexity,dynamic environments,execution cycles,partial planning,real-time planning algorithm,response-time constraints,cost function,art,computer science,application software,real time,artificial intelligence,routing,time complexity
Planning algorithms,Cognitive systems,Computer science,Response time,Real-time computing,Artificial intelligence,Time complexity,Application software,Mathematical optimization,Obsolescence,Total cost,Machine learning,Computational complexity theory
Conference
Citations 
PageRank 
References 
7
3.73
8
Authors
2
Name
Order
Citations
PageRank
Hamidzadeh Babak118424.99
Shashi Shekhar243521098.43