The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
2017
DOI: 10.1007/s10846-017-0496-7
|View full text |Cite
|
Sign up to set email alerts
|

Non-prespecified Starting Depot Formulations for Minimum-Distance Trajectory Optimization in Patrolling Problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 17 publications
0
1
0
Order By: Relevance
“…The distinctive feature of the problem investigated here is that the two main assumptions highlighted in the previous paragraph are relaxed, hence a more general model is developed for the MmTSP [18, 25]. The paper introduces three new formulations, extending the authors' previous work in [26, 27]. In the first formulation, the starting depots and the number of patrolling robots starting from each depot are not pre‐specified.…”
Section: Introductionmentioning
confidence: 99%
“…The distinctive feature of the problem investigated here is that the two main assumptions highlighted in the previous paragraph are relaxed, hence a more general model is developed for the MmTSP [18, 25]. The paper introduces three new formulations, extending the authors' previous work in [26, 27]. In the first formulation, the starting depots and the number of patrolling robots starting from each depot are not pre‐specified.…”
Section: Introductionmentioning
confidence: 99%