Pages that link to "Item:Q2427183"

The following pages link to Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times (Q2427183):

Displaying 9 items.

• Cops and invisible robbers: the cost of drunkenness (Q385064) (← 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)
• The eye and the fist: optimizing search and interdiction (Q1926771) (← links)
• Minimizing the average searching time for an object within a graph (Q2007833) (← links)
• Ant colony optimization for path planning in search and rescue operations (Q2083926) (← links)
• Aerial vehicle search-path optimization: a novel method for emergency operations (Q2397472) (← links)
• Route optimization for multiple searchers (Q3065632) (← links)