Spatio-temporal multi-robot routing (Q900215): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Efficient Routing Algorithms for Multiple Vehicles With no Explicit Communications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations for Steiner trees with minimum number of Steiner points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spatio-temporal multi-robot routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner tree problem with minimum number of Steiner points and bounded edge-length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751373 / rank
 
Normal rank

Latest revision as of 05:20, 11 July 2024

scientific article
Language Label Description Also known as
English
Spatio-temporal multi-robot routing
scientific article

    Statements

    Spatio-temporal multi-robot routing (English)
    0 references
    0 references
    0 references
    0 references
    21 December 2015
    0 references
    assignment problems
    0 references
    autonomous mobile robots
    0 references
    connectivity constraints
    0 references
    optimization problems
    0 references
    vehicle routing
    0 references

    Identifiers