paper-with-me

Papers

Optimization-Based Path-Planning for Connected and non-Connected Automated Vehicles

2021-04-14 · Panagiotis Typaldos, Markos Papageorgiou, Ioannis Papamichail

A path-planning algorithm for connected and non-connected automated road vehicles on multilane motorways is derived from the opportune formulation of an optimal control problem. In this framework, the objective function to be minimized contains appropriate respective terms to reflect: the goals of vehicle advancement; passenger comfort; and avoidance of collisions with other vehicles, of road departures and of negative speeds. Connectivity implies that connected vehicles are able to exchange with each other (V2V) or the infrastructure (V2I), real-time information about their last generated path. For the numerical solution of the optimal control problem, an efficient feasible direction algorithm is used. To ensure high-quality local minima, a simplified Dynamic Programming algorithm is also conceived to deliver the initial guess trajectory for the feasible direction algorithm. Thanks to low computation times, the approach is readily executable within a model predictive control (MPC) framework. The proposed MPC-based approach is embedded within the Aimsun microsimulation platform, which enables the evaluation of a plethora of realistic vehicle driving and advancement scenarios. Results obtained on a multilane motorway stretch indicate higher efficiency of the optimally controlled vehicles in driving closer to their desired speed, compared to ordinary Aimsun vehicles. Increased penetration rates of automated vehicles are found to increase the efficiency of the overall traffic flow, benefiting manual vehicles as well. Moreover, connected controlled vehicles appear to be more efficient compared to the corresponding non-connected controlled vehicles, due to the improved real-time information and short-term prediction.

📄 PDF Abstract BibTeX arXiv:2104.06778

Code (0)

등록된 구현이 없습니다.

Tasks

Model Predictive Control

Similar Papers 제목 키워드 기반

Multi-Robot Connected Fermat Spiral Coverage

2024-03-20 · Jingtao Tang, Hang Ma

We introduce the Multi-Robot Connected Fermat Spiral (MCFS), a novel algorithmic framework for Multi-Robot Coverage Path Planning (MCPP) that adapts Connected Fermat Spiral (CFS) from the computer graphics community to m…

Combinatorial Optimization

Formation Control for Connected and Automated Vehicles on Multi-lane Roads: Relative Motion Planning and Conflict Resolution

2021-03-18 · Mengchi Cai, Qing Xu, Chaoyi Chen, Jiawei Wang 외

Multi-vehicle coordinated decision making and control can improve traffic efficiency while guaranteeing driving safety. Formation control is a typical multi-vehicle coordination method in the multi-lane scenario. Among t…

Decision MakingMotion PlanningTrajectory Planning

APE: An Open and Shared Annotated Dataset for Learning Urban Pedestrian Path Networks

2023-03-04 · Yuxiang Zhang, Nicholas Bolten, Sachin Mehta, Anat Caspi

Inferring the full transportation network, including sidewalks and cycleways, is crucial for many automated systems, including autonomous driving, multi-modal navigation, trip planning, mobility simulations, and freight …

Autonomous Driving

Efficient coverage planning for full-area C-ITS communications based on radio propagation simulation and measurement tools

2022-02-07 · Hagen Ußler, Christian Setzefand, Daniel Kanis, Paul Schwarzbach 외

Intelligent infrastructure, currently often consisting of C-ITS stations and prospectively supplemented by 5G, is a key-enabler for application-oriented and area-wide realization of highly automated and connected driving…

Reachability and Coverage Planning for Connected Agents: Extended Version

2019-03-11 · Tristan Charrier, Arthur Queffelec, Ocan Sankur, François Schwarzentruber

Motivated by the increasing appeal of robots in information-gathering missions, we study multi-agent path planning problems in which the agents must remain interconnected. We model an area by a topological graph specifyi…