Pages that link to "Item:Q4698128"
From MaRDI portal
The following pages link to Criteria and approximate methods for path-constrained moving-target search problems (Q4698128):
Displaying 13 items.
- Path optimization for a moving object in an anisotropic environment using the probabilistic criterion in the passive sonar mode (Q500298) (← links)
- Three problems in searching for a moving target between two sites (Q902327) (← links)
- A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search (Q958076) (← links)
- Sensor planning for elusive targets (Q1368497) (← links)
- Trajectory optimization under kinematical constraints for moving target search (Q1651570) (← links)
- Solving the moving target search problem using indistinguishable searchers (Q1711443) (← links)
- Moving target search optimization -- a literature review (Q1722971) (← links)
- Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times (Q2427183) (← links)
- Technical Note—Trading Off Quick versus Slow Actions in Optimal Search (Q3453336) (← links)
- The Optimal Search for a Moving Target When the Search Path Is Constrained (Q3675866) (← links)
- Branch and bound methods for a search problem (Q4255007) (← links)
- Using multiple searchers in constrained-path, moving-target search problems (Q4883164) (← links)
- Optimal search for a moving target with the option to wait (Q5187932) (← links)
