2022
DOI: 10.1007/978-3-031-09726-3_5
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Scheduling and Navigation Approach for Warehouse Multi-Mobile Robots

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 12 publications
0
1
0
Order By: Relevance
“…There are many variants: the colored traveling salesman problem [ 1 ], the intermittent traveling salesman problem [ 2 ], the traveling salesman problem with release times [ 3 ], the traveling salesman problem with draft limits [ 4 ], and large-scale general colored traveling salesman [ 5 ]. As robotic technology advances, a mobile robot faces multi-target path planning problems in numerous circumstances [ 6 , 7 , 8 , 9 ]. The usual optimization criteria of the planning algorithm are the path length or the time cost [ 10 , 11 , 12 ].…”
Section: Introductionmentioning
confidence: 99%
“…There are many variants: the colored traveling salesman problem [ 1 ], the intermittent traveling salesman problem [ 2 ], the traveling salesman problem with release times [ 3 ], the traveling salesman problem with draft limits [ 4 ], and large-scale general colored traveling salesman [ 5 ]. As robotic technology advances, a mobile robot faces multi-target path planning problems in numerous circumstances [ 6 , 7 , 8 , 9 ]. The usual optimization criteria of the planning algorithm are the path length or the time cost [ 10 , 11 , 12 ].…”
Section: Introductionmentioning
confidence: 99%