TY - GEN
T1 - Self-adjusting real-time search
T2 - Proceedings of the 5th International Conference on Tools with Artificial Intelligence TAI '93
AU - Shekhar, Shashi
AU - Hamidzadeh, Babak
PY - 1993
Y1 - 1993
N2 - Real-time search algorithms need to address the deadlines imposed by applications like process control and robot navigation. Possible deadline violations should be predicted ahead of time to allow remedial actions to prevent the undesirable consequences of missing deadlines. The algorithms should also demonstrate progressively optimizing behavior. That is, they should improve the quality of the solutions as time constraints are relaxed. To successfully address these issues, a real-time search algorithm must address the central problem of choosing the proper values for its parameters, which control the time allocated to planning. We proposed a new approach to determine the parameter values of a real-time search algorithm, in order to enable the algorithm to meet deadlines, exhibit progressively optimizing behavior, and to predict deadline violation prior to the deadline. The paper provides a theoretical and experimental characterization of the proposed algorithm.
AB - Real-time search algorithms need to address the deadlines imposed by applications like process control and robot navigation. Possible deadline violations should be predicted ahead of time to allow remedial actions to prevent the undesirable consequences of missing deadlines. The algorithms should also demonstrate progressively optimizing behavior. That is, they should improve the quality of the solutions as time constraints are relaxed. To successfully address these issues, a real-time search algorithm must address the central problem of choosing the proper values for its parameters, which control the time allocated to planning. We proposed a new approach to determine the parameter values of a real-time search algorithm, in order to enable the algorithm to meet deadlines, exhibit progressively optimizing behavior, and to predict deadline violation prior to the deadline. The paper provides a theoretical and experimental characterization of the proposed algorithm.
UR - http://www.scopus.com/inward/record.url?scp=0027844626&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0027844626&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:0027844626
SN - 0818642009
T3 - Proceedings of the International Conference on Tools with Artificial Intelligence
SP - 224
EP - 231
BT - Proceedings of the International Conference on Tools with Artificial Intelligence
A2 - Anon, null
PB - Publ by IEEE
Y2 - 8 November 1993 through 11 November 1993
ER -