2021
DOI: 10.1007/s11370-021-00381-8
|View full text |Cite
|
Sign up to set email alerts
|

Automatic task scheduling optimization and collision-free path planning for multi-areas problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(6 citation statements)
references
References 32 publications
0
6
0
Order By: Relevance
“…Solving the MTP directly is challenging due to the large number of possibly collision-free paths. Therefore, we adopt a two-step method similar to [29]. In the first step, we determine the optimal sequence that visits every ToI by simplifying the problem to a TSP.…”
Section: Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…Solving the MTP directly is challenging due to the large number of possibly collision-free paths. Therefore, we adopt a two-step method similar to [29]. In the first step, we determine the optimal sequence that visits every ToI by simplifying the problem to a TSP.…”
Section: Methodsmentioning
confidence: 99%
“…1) IDP / DP / Iterative Rubber Band Algorithm (IRBA) Comparison: We compare the performance of the IDP with the method of preplanning all M 2 (N − 1) + 2M collision-free paths before performing DP once, which we refer to as DP, and an adaption of the method proposed in [29] used to solve MTPGR, which we refer to as Iterative RBA (IRBA).…”
Section: Experiments a Simulationmentioning
confidence: 99%
See 1 more Smart Citation
“…In addition, when multiple tasks are perceived, CBASH must perform them with a rule for saving time and resources. Therefore, task planning should be considered to perform tasks [34].…”
Section: G Task Planningmentioning
confidence: 99%
“…In solving practical problems, MTP problems extend beyond TSP problems, involving the coupling of task sequence optimization and collision-free path planning. Many studies seek to simplify the problem under specified conditions [18]. Ye et al [19] proposed an innovative approach that integrates collision avoidance path planning using the Improved Probabilistic Roadmap method with delivery sequence optimization using the Improved Genetic Algorithm to solve MTP.…”
Section: Introductionmentioning
confidence: 99%