Pages that link to "Item:Q3675866"

The following pages link to The Optimal Search for a Moving Target When the Search Path Is Constrained (Q3675866):

Displaying 29 items.

• Planning and acting in partially observable stochastic domains (Q72343) (← links)
• A leader-follower partially observed, multiobjective Markov game (Q256610) (← links)
• Optimal search for moving targets (Q287585) (← links)
• A DC programming approach for planning a multisensor multizone search for a target (Q336797) (← links)
• How patient compliance impacts the recommendations for colorectal cancer screening (Q887881) (← links)
• A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search (Q958076) (← links)
• Optimal search-relocation trade-off in Markovian-target searching (Q1001004) (← links)
• A hierarchical approach for planning a multisensor multizone search for a moving target (Q1013393) (← links)
• Optimal strategy of route and look for the path constrained search problem with reward criterion (Q1278090) (← 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)
• Honey-pot constrained searching with local sensory information (Q2507866) (← links)
• Optimal searching for a Helix target motion (Q2515305) (← links)
• A survey of algorithmic methods for partially observed Markov decision processes (Q2638960) (← links)
• Technical Note—Trading Off Quick versus Slow Actions in Optimal Search (Q3453336) (← links)
• Path optimization for the resource-constrained searcher (Q3580160) (← links)
• (Q3735435) (← links)
• (Q3829344) (← links)
• Optimal Whereabouts Search for a Moving Target (Q3929383) (← links)
• (Q4474328) (← links)
• Optimal search for a moving target with no time information maximizing the expected reward (Q4538142) (← links)
• Criteria and approximate methods for path-constrained moving-target search problems (Q4698128) (← links)
• Technical Note—The Complexity of the Optimal Searcher Path Problem (Q4724426) (← links)
• (Q4805049) (← links)
• Nonstationary Bandits with Habituation and Recovery Dynamics (Q5144777) (← links)
• A Based-DC Programming Approach for Planning a Multisensor Multizone Search for a Moving Target (Q5356975) (← links)
• Constrained minimax optimization of continuous search efforts for the detection of a stationary target (Q5438257) (← links)
• Under-approximating expected total rewards in POMDPs (Q6535603) (← links)