Dynamic Search Planning
Dynamic Search Planning is a methodological framework within search planning that adaptively refines search strategies in real-time based on evolving environmental feedback and uncertainty, distinguishing it from static or predetermined search approaches.
22
Publications
1K
Citations
60
Authors
32
Institutions
Publications per year
2017–2026
6
Parents
22
Anytime dynamic A*: an anytime, replanning algorithm
Maxim Likhachev, Dave Ferguson, Geoff Gordon et al. · 2005 · 538 citations
1–5 of 22
60
2
h-index
2
h-index
1
h-index
1
h-index
1
h-index
1–5 of 60
32
Loughborough University
Loughborough, United Kingdom
2 h-index
2 publications
50 citations

Carleton University
Ottawa, Canada
1 h-index
2 publications
22 citations
Stanford University
Stanford, United States
1 h-index
1 publications
538 citations
Universidad La República
Santiago, Chile
1 h-index
3 publications
63 citations
Carnegie Mellon University
Pittsburgh, United States
1 h-index
4 publications
2.2K citations

Naval Postgraduate School
Monterey, United States
1 h-index
2 publications
28 citations

Hunan University
Changsha, China
1 h-index
2 publications
40 citations
University of Patras
Pátrai, Greece
1 h-index
3 publications
30 citations
1–8 of 32
1 publications · 45 citations
1
h-index
1 publications · 29 citations
1
h-index
1 publications · 10 citations
1
h-index
1 publications · 21 citations
1
h-index
TCDS · 1 publications · 20 citations
1
h-index
1–5