scispace - formally typeset
Journal ArticleDOI

A Hierarchical Multi-Vehicle Coordinated Motion Planning Method based on Interactive Spatio-Temporal Corridors

TLDR
Wang et al. as mentioned in this paper proposed a hierarchical method based on interactive spatio-temporal corridors (ISTCs) for multi-vehicle coordinated motion planning, which can decouple the high-dimensional conflicts and further reduce the difficulty of obtaining feasible trajectories.
Abstract
Multi-vehicle coordinated motion planning has always been challenged to safely and efficiently resolve conflicts under non-holonomic dynamic constraints. Constructing spatial-temporal corridors for multi-vehicle can decouple the high-dimensional conflicts and further reduce the difficulty of obtaining feasible trajectories. Therefore, this paper proposes a novel hierarchical method based on interactive spatio-temporal corridors (ISTCs). In the first layer, based on the initial guidance trajectories, Mixed Integer Quadratic Programming is designed to construct ISTCs capable of resolving conflicts in generic multi-vehicle scenarios. And then in the second layer, Non-Linear Programming is settled to generate in-corridor trajectories that satisfy the vehicle dynamics. By introducing ISTCs, the multi-vehicle coordinated motion planning problem is able to be decoupled into single-vehicle trajectory optimization problems, which greatly decentralizes the computational pressure and has great potential for real-world applications. Besides, the proposed method searches for feasible solutions in the 3-D $(x,y,t)$ configuration space, preserving more possibilities than the traditional velocity-path decoupling method. Simulated experiments in unsignalized intersection and challenging dense scenarios have been conduced to verify the feasibility and adaptability of the proposed framework.

read more

Content maybe subject to copyright    Report

References
More filters
Journal ArticleDOI

A Survey on the Coordination of Connected and Automated Vehicles at Intersections and Merging at Highway On-Ramps

TL;DR: The developments and the research trends in coordination with the CAVs that have been reported in the literature to date are summarized and remaining challenges and potential future research directions are discussed.
Journal ArticleDOI

Planning Dynamically Feasible Trajectories for Quadrotors Using Safe Flight Corridors in 3-D Complex Environments

TL;DR: This work proposes a method to formulate trajectory generation as a quadratic program (QP) using the concept of a Safe Flight Corridor (SFC), a collection of convex overlapping polyhedra that models free space and provides a connected path from the robot to the goal position.
Proceedings Article

Finding optimal solutions to cooperative pathfinding problems

TL;DR: This work proposes a technique called operator decomposition, which can be used to reduce the branching factors of many search algorithms, including algorithms for cooperative pathfinding, and shows how a type of independence common in instances of Cooperative pathfinding problems can be exploited.
Journal ArticleDOI

A Survey of the Connected Vehicle Landscape—Architectures, Enabling Technologies, Applications, and Development Areas

TL;DR: This paper summarizes the state of the art in connected vehicles—from the need for vehicle data and applications thereof, to enabling technologies, challenges, and identified opportunities—from extensibility and scalability to privacy and security.
Proceedings Article

Structure and intractability of optimal multi-robot path planning on graphs

TL;DR: The NP-hardness proof for the time optimal versions of the discrete multi-robot path planning problem shows that these problems remain NP- hard even when there are only two groups of robots (i.e. robots within each group are interchangeable).