2020
DOI: 10.1002/rob.21952
|View full text |Cite
|
Sign up to set email alerts
|

Falco: Fast likelihood‐based collision avoidance with extension to human‐guided navigation

Abstract: We propose a planning method to enable fast autonomous flight in cluttered environments. Typically, autonomous navigation through a complex environment requires a continuous search on a graph generated by a k-connected grid or a probabilistic scheme. As the vehicle travels, updating the graph with data from onboard sensors is expensive as is the search on the graph especially if the paths must be kinodynamically feasible. We propose to avoid the online search to reduce

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
23
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 57 publications
(29 citation statements)
references
References 28 publications
0
23
0
Order By: Relevance
“…The custom robot is developed for simulation studies assuming a quadrotor 350 mm MAV model with a laser scanner, a 2D rotating scanner up to 20 m. The local planning window is set to 5 m  5 m  5 m around the current vehicle pose, and the flight speed was set to 2 m/s. In all simulated tests the performance comparison is conducted with receding horizon rapidly-exploring random tree * (RHRRT * ) [34] and likelihood-based planning [35]. Simulation results presenting the performance of the (a) proposed planner, (b) Falco, and (c) RHRRT * planner are shown in Figures 6, 7, and 8.…”
Section: Simulation Resultsmentioning
confidence: 99%
“…The custom robot is developed for simulation studies assuming a quadrotor 350 mm MAV model with a laser scanner, a 2D rotating scanner up to 20 m. The local planning window is set to 5 m  5 m  5 m around the current vehicle pose, and the flight speed was set to 2 m/s. In all simulated tests the performance comparison is conducted with receding horizon rapidly-exploring random tree * (RHRRT * ) [34] and likelihood-based planning [35]. Simulation results presenting the performance of the (a) proposed planner, (b) Falco, and (c) RHRRT * planner are shown in Figures 6, 7, and 8.…”
Section: Simulation Resultsmentioning
confidence: 99%
“…To understand the nature of the PROMPT planning framework and its efficacy to current state-of-the-art planners, we compare our planners (PROMPT-O, PROMPT-S) with two classes of planners: search based discrete motion primitives planner FALCO( [25]) and trajectory optimisation based planners STOMP( [7]) and TEB( [20]). While there are numerous variants to these planners, these three have been chosen due to their demonstrated improved performance over others.…”
Section: Methodsmentioning
confidence: 99%
“…Recent work on discrete motion primitives, [25], introduces path groups as a mechanism to couple a set of deterministic trajectories whose combined quality (in terms of likelihood of collision free path) enables robust trajectory planning for partially known environments. In essence our approach takes a probabilistic approach of representing such trajectory bundles as Gaussian radial basis functions (GRBFs).…”
Section: Introductionmentioning
confidence: 99%
“…Then, the mapping module stitches sensor measurements concerning their associated poses and reconstructs the surroundings. Finally, based on the reconstructed map, the motion planning module generates obstacle-awareness and smooth trajectories [14], [15]. The mapping module in the navigation work bridges the gap between localization and planning modules and provides a human-readable map to the system monitor.…”
Section: Relative Workmentioning
confidence: 99%