IECON 2015 - 41st Annual Conference of the IEEE Industrial Electronics Society 2015
DOI: 10.1109/iecon.2015.7392731
|View full text |Cite
|
Sign up to set email alerts
|

Coverage path planning based on a multiple sweep line decomposition

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
6
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(6 citation statements)
references
References 22 publications
0
6
0
Order By: Relevance
“…F I G U R E 15 Different sweepline based decomposition techniques with the considered events (green), assuming a vertical sweepline. (a) Trapezoidal (Choset et al, 2005), (b) Boustrophedon (Choset et al, 2000), (c) Alternative Boustrophedon decomposition perpendicular to sweepline direction (Pham et al, 2017), (d) Boustrophedon including concave inflections (Yu & Hung, 2015). in Huang (2001), where multiple events can occur simultaneously and an event can also consist of a sequence of consecutive vertices.…”
Section: Boustrophedon Decompositionmentioning
confidence: 99%
See 4 more Smart Citations
“…F I G U R E 15 Different sweepline based decomposition techniques with the considered events (green), assuming a vertical sweepline. (a) Trapezoidal (Choset et al, 2005), (b) Boustrophedon (Choset et al, 2000), (c) Alternative Boustrophedon decomposition perpendicular to sweepline direction (Pham et al, 2017), (d) Boustrophedon including concave inflections (Yu & Hung, 2015). in Huang (2001), where multiple events can occur simultaneously and an event can also consist of a sequence of consecutive vertices.…”
Section: Boustrophedon Decompositionmentioning
confidence: 99%
“…As such, research often seeks to minimize the number of maneuvers as a means of indirectly optimizing for operation time, conserving energy and extending fuel use (Cabreira et al, 2019). A large part of the literature uses the criterion of minimizing the number of parallel tracks, and thus the number of turning maneuvers (Cabreira et al, 2019; Huang, 2001; Li et al, 2011; Torres et al, 2016; Yu & Hung, 2015). The costs to cover a convex polygon P $P$ with guidance tracks with an angle θ $\theta $ are then defined by C(θ;P)=nPθ. $C(\theta ;P)={n}_{P}^{\theta }.$…”
Section: Cost Functionsmentioning
confidence: 99%
See 3 more Smart Citations