Penalty-Based Algorithms for the Stochastic Obstacle Scene Problem (Q2962565): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optimal obstacle placement with disambiguations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The reset disambiguation policy for navigating stochastic obstacle fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient, optimal stochastic-action selection when limited by an action budget / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic planning with clear preferences on missing information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths without a map / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random disambiguation paths for traversing a mapped hazard field / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm to find shortest paths with recourse / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Canadian Traveller Problem and its competitive analysis / rank
 
Normal rank

Latest revision as of 10:21, 13 July 2024

scientific article
Language Label Description Also known as
English
Penalty-Based Algorithms for the Stochastic Obstacle Scene Problem
scientific article

    Statements

    Identifiers