Pages that link to "Item:Q4724426"
From MaRDI portal
The following pages link to Technical Note—The Complexity of the Optimal Searcher Path Problem (Q4724426):
Displaying 28 items.
- An innovative multi-agent search-and-rescue path planning approach (Q337250) (← links)
- A sequential perspective on searching for static targets (Q421645) (← links)
- Static target search path planning optimization with heterogeneous agents (Q512934) (← links)
- Optimal search path for service in the presence of disruptions (Q716349) (← links)
- Resource finding in store-and-forward networks (Q758183) (← links)
- General cops and robbers games with randomness (Q820532) (← links)
- Scheduling an autonomous robot searching for hidden targets (Q829171) (← links)
- A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search (Q958076) (← links)
- Modeling sequential searches with ancillary target dependencies (Q965877) (← links)
- Optimal search-relocation trade-off in Markovian-target searching (Q1001004) (← links)
- Optimal strategy of route and look for the path constrained search problem with reward criterion (Q1278090) (← links)
- Complexity of searching an immobile hider in a graph (Q1377669) (← links)
- Helicopter search problems, bandwidth and pathwidth (Q1392549) (← links)
- Complexity of path discovery game problems (Q1566737) (← links)
- A search game when a search path is given (Q1576344) (← links)
- Trajectory optimization under kinematical constraints for moving target search (Q1651570) (← links)
- Solving the moving target search problem using indistinguishable searchers (Q1711443) (← links)
- A pathfinding problem for search trees with unknown edge length (Q1784979) (← links)
- Ant colony optimization for path planning in search and rescue operations (Q2083926) (← links)
- Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times (Q2427183) (← links)
- Honey-pot constrained searching with local sensory information (Q2507866) (← links)
- (Q3140448) (← links)
- (Q3180863) (← links)
- Technical Note—Trading Off Quick versus Slow Actions in Optimal Search (Q3453336) (← links)
- Path optimization for the resource-constrained searcher (Q3580160) (← links)
- (Q4515740) (← links)
- Exact and Approximation Algorithms for the Expanding Search Problem (Q5084651) (← links)
- On the computational complexity of the patrol boat scheduling problem with complete coverage (Q6093558) (← links)
