2015 Pattern Recognition Association of South Africa and Robotics and Mechatronics International Conference (PRASA-RobMech) 2015
DOI: 10.1109/robomech.2015.7359518
|View full text |Cite
|
Sign up to set email alerts
|

A local planner for Ackermann-driven vehicles in ROS SBPL

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
3
0
1

Year Published

2018
2018
2023
2023

Publication Types

Select...
3
3
1

Relationship

1
6

Authors

Journals

citations
Cited by 7 publications
(4 citation statements)
references
References 15 publications
0
3
0
1
Order By: Relevance
“…A global route is planned via a free-space planner like smac or map-based planner using a Lanelet2 HD map. The vehicle follows this path utilising a path-following module, including a feedback loop [34,35]. As path-following algorithm, we use a model-predictive controller (MPC) which uses a GPU-based grid-search on a set of predicted trajectories achievable by the vehicle's kinematic model.…”
Section: Software Architecturementioning
confidence: 99%
“…A global route is planned via a free-space planner like smac or map-based planner using a Lanelet2 HD map. The vehicle follows this path utilising a path-following module, including a feedback loop [34,35]. As path-following algorithm, we use a model-predictive controller (MPC) which uses a GPU-based grid-search on a set of predicted trajectories achievable by the vehicle's kinematic model.…”
Section: Software Architecturementioning
confidence: 99%
“…However, state-of-the-art global path criteria are traditionally limited to minimum-distance to the goal. The most popular are Dijkstra and A-star algorithms [5], and kinematics constrains through motion primitives such as Search-based Planning Library (SBPL) [11,12]. Although Dijkstra provides the optimal path distance, it's main drawback is the path search ability that becomes computationally heavy for large environment as it requires to explore the whole environment A-star was proposed as an improvement to cope with the computation time of Dijkstra by adding a heuristic term that indicates the closeness of each cell to the goal.…”
Section: Introductionmentioning
confidence: 99%
“…The mainstream research of UMV systems focuses on the combined use of multiple sensors to exploit their complementary advantages and disadvantages. Potdar et al [18] proposed a method to accomplish localization, obstacle detection, and path planning in an Ackerman steering robot [19,20] using a single camera and LiDAR sensor; LiDAR data are transmitted over a wireless network to a computer using the TCP/IP protocol, and obstacle data from the robot are augmented with potential fields and combined with positional data from overhead cameras to construct cost maps for use in navigational algorithms. Four different search algorithms [21][22][23] were implemented for testing.…”
Section: Introductionmentioning
confidence: 99%