Name
Abstract | ||
|---|---|---|
There has been a recent rise in research on real-time planning algorithms. Most of these algorithms address either the issue of response-time constraints or the issue of dynamic environ- ments. We propose a new real-time planning algorithm, DYNORAII, to address both of these issues simultaneously. DYNORAII is structured as a sequence of ''partial planning and execu- tion'' cycles to avoid obsolescence of planned solutions at the time of execution. DYNORAII uses a stopping criterion to balance planning cost and execution cost to achieve near optimal response times. DYNORAII was used for the routing problem to optimize total cost in both static and dynamic environments. It shows better average-case time complexity than traditional real- time algorithms. |
Year | Venue | Keywords |
|---|---|---|
1993 | International Journal on Artificial Intelligence Tools | search,real-time,tradeoff between planning and execution costs. |
Field | DocType | Volume |
Obsolescence,Planning algorithms,Computer science,Real-time computing,Artificial intelligence,Time complexity,Total cost,Machine learning,Distributed computing | Journal | 2 |
Issue | Citations | PageRank |
1 | 3 | 0.42 |
References | Authors | |
11 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hamidzadeh Babak | 1 | 184 | 24.99 |
| Shashi Shekhar | 2 | 4352 | 1098.43 |