Aerial vehicle search-path optimization: a novel method for emergency operations (Q2397472): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3833854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The budgeted maximum coverage problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search for Targets with Conditionally Deterministic Motion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search-trajectory optimization. I: Formulation and theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search-trajectory optimization. II: Algorithms and computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: OPTIMAL SURVIVOR SEARCH FOR A TARGET WITH CONDITIONALLY DETERMINISTIC MOTION UNDER REWARD CRITERION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using multiple searchers in constrained-path, moving-target search problems / rank
 
Normal rank

Latest revision as of 21:21, 13 July 2024

scientific article
Language Label Description Also known as
English
Aerial vehicle search-path optimization: a novel method for emergency operations
scientific article

    Statements

    Aerial vehicle search-path optimization: a novel method for emergency operations (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 May 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    aerial vehicle
    0 references
    moving target search
    0 references
    search-path optimization
    0 references
    time-dependent routing
    0 references
    0 references