Sciweavers

129 search results - page 1 / 26
» Optimal solutions for moving target search
Sort
View
ATAL
2009
Springer
13 years 11 months ago
Optimal solutions for moving target search
Carsten Moldenhauer, Nathan R. Sturtevant
CORR
2011
Springer
179views Education» more  CORR 2011»
12 years 12 months ago
Cooperative searching for stochastic targets
Spatial search problems abound in the real world, from locating hidden nuclear or chemical sources to finding skiers after an avalanche. We exemplify the formalism and solution fo...
Vadas Gintautas, Aric A. Hagberg, Luís M. A...
IROS
2006
IEEE
97views Robotics» more  IROS 2006»
13 years 11 months ago
Probabilistic Search for a Moving Target in an Indoor Environment
– We consider a search for a target moving within a known indoor environment partitioned into interconnected regions of varying sizes. The knowledge of target location is describ...
Haye Lau, Shoudong Huang, Gamini Dissanayake
ICRA
2008
IEEE
128views Robotics» more  ICRA 2008»
13 years 11 months ago
A point-based POMDP planner for target tracking
— Target tracking has two variants that are often studied independently with different approaches: target searching requires a robot to find a target initially not visible, and ...
David Hsu, Wee Sun Lee, Nan Rong
EOR
2008
78views more  EOR 2008»
13 years 5 months ago
Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times
We consider an extension of the optimal searcher path problem (OSP), where a searcher moving through a discretised environment may now need to spend a nonuniform amount of time tr...
Haye Lau, Shoudong Huang, Gamini Dissanayake