2021 IEEE International Conference on Robotics and Automation (ICRA) 2021
DOI: 10.1109/icra48506.2021.9560969
|View full text |Cite
|
Sign up to set email alerts
|

Search-based Planning of Dynamic MAV Trajectories Using Local Multiresolution State Lattices

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
13
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
3
3
1

Relationship

3
4

Authors

Journals

citations
Cited by 11 publications
(14 citation statements)
references
References 18 publications
1
13
0
Order By: Relevance
“…This is done by grouping motion primitives that represent similar actions and considering only the longest collision-free primitive from each group. Schleich and Behnke [16] apply the idea of local multiresolution [17] to state lattices for faster replanning of dynamic UAV trajectories.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…This is done by grouping motion primitives that represent similar actions and considering only the longest collision-free primitive from each group. Schleich and Behnke [16] apply the idea of local multiresolution [17] to state lattices for faster replanning of dynamic UAV trajectories.…”
Section: Related Workmentioning
confidence: 99%
“…Thus, we model the UAV state as 6-tuples s = (p, v) ∈ R 6 or 9-tuples s = (p, v, a) ∈ R 9 , consisting of a discretized 3D position p, velocity v, and acceleration a. To compare against the State of the Art, we combine δ-Spaces with the searchbased trajectory generation methods from [2] and [16]. In both works, the set of state transitions E h consists of motion primitives e u,τ which are generated by applying constant acceleration or jerk commands u over a short time interval τ .…”
Section: Application To Uav Trajectory Planningmentioning
confidence: 99%
See 1 more Smart Citation
“…We employ our trajectory planning method from [21], which is based on the framework of Liu et al [12]. The MAV state is modeled as a 6-tuple s = (p, v) ∈ R 6 consisting of a 3D position p and velocity v. A state lattice graph G is generated by unrolling motion primitives from the initial MAV state s 0 .…”
Section: E Trajectory Planningmentioning
confidence: 99%
“…During search, we combine the 1D costs into an estimate for the 3D costs: The flight time is calculated as the maximum over the individual axes, and the control costs are those of the sub-problem with highest execution time. For further details on local multiresolutional state lattices and the proposed 1D heuristic, we refer to [21].…”
Section: E Trajectory Planningmentioning
confidence: 99%