2019
DOI: 10.1080/01605682.2019.1654941
|View full text |Cite
|
Sign up to set email alerts
|

Research on robot charging strategy based on the scheduling algorithm of minimum encounter time

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 9 publications
0
3
0
Order By: Relevance
“…The adoption of mobile chargers improves the flexibility of the charging process. Cheng et al (2021) study the minimum required quantity of mobile chargers and the scheduling of mobile chargers for power supplements of robots.…”
Section: Strategic Decisionmentioning
confidence: 99%
“…The adoption of mobile chargers improves the flexibility of the charging process. Cheng et al (2021) study the minimum required quantity of mobile chargers and the scheduling of mobile chargers for power supplements of robots.…”
Section: Strategic Decisionmentioning
confidence: 99%
“…Various scheduling techniques employed for mobile robots primarily focused on task-based scheduling. In previous studies, various scheduling problems were solved using integer linear programming (Tiotsop et al, 2020) (Cheng et al, 2019), and dynamic programming (Jin et al, 2006). Optimal scheduling problems arising in different real-world activities have been solved using classical search and optimization algorithms including linear programming methods.…”
Section: Introductionmentioning
confidence: 99%
“…Some methods used in designing a scheduling strategy are linear programming, nonlinear programming, clustering analysis, TSP algorithm, queuing theory, and other mathematical methods. In this way, Cheng et al (2021) proposed a mesh model to cope with the robot’s limited movements and the MCs. Considering the distances between the MCs and the robot and the expended time at the charge station, they developed a scheduling algorithm of minimum encounter time to solve the recharging problem in a robot that executes a priority task.…”
Section: Introductionmentioning
confidence: 99%