Symbolic perception-based autonomous driving in dynamic environments using 4D/RCS

2007 ◽  
Author(s):  
M, Foedisch ◽  
R. Madhavan ◽  
C. Schlenoff
Author(s):  
Yu Zhang ◽  
Huiyan Chen ◽  
Steven L. Waslander ◽  
Tian Yang ◽  
Sheng Zhang ◽  
...  

In this paper, we present a complete, flexible and safe convex-optimization-based method to solve speed planning problems over a fixed path for autonomous driving in both static and dynamic environments. Our contributions are five fold. First, we summarize the most common constraints raised in various autonomous driving scenarios as the requirements for speed planner developments and metrics to measure the capacity of existing speed planners roughly for autonomous driving. Second, we introduce a more general, flexible and complete speed planning mathematical model including all the summarized constraints compared to the state-of-the-art speed planners, which addresses limitations of existing methods and is able to provide smooth, safety-guaranteed, dynamic-feasible, and time-efficient speed profiles. Third, we emphasize comfort while guaranteeing fundamental motion safety without sacrificing the mobility of cars by treating the comfort box constraint as a semi-hard constraint in optimization via slack variables and penalty functions, which distinguishes our method from existing ones. Fourth, we demonstrate that our problem preserves convexity with the added constraints, thus global optimality of solutions is guaranteed. Fifth, we showcase how our formulation can be used in various autonomous driving scenarios by providing several challenging case studies in both static and dynamic environments. A range of numerical experiments and challenging realistic speed planning case studies have depicted that the proposed method outperforms existing speed planners for autonomous driving in terms of constraint type covered, optimality, safety, mobility and flexibility.


Author(s):  
Yu Zhang ◽  
Huiyan Chen ◽  
Steven L. Waslander ◽  
Tian Yang ◽  
Sheng Zhang ◽  
...  

In this paper, we present a complete, flexible and safe convex-optimization-based method to solve speed planning problems over a fixed path for autonomous driving in both static and dynamic environments. Our contributions are five fold. First, we summarize the most common constraints raised in various autonomous driving scenarios as the requirements for speed planner developments and metrics to measure the capacity of existing speed planners roughly for autonomous driving. Second, we introduce a more general, flexible and complete speed planning mathematical model including all the summarized constraints compared to the state-of-the-art speed planners, which addresses limitations of existing methods and is able to provide smooth, safety-guaranteed, dynamic-feasible, and time-efficient speed profiles. Third, we emphasize comfort while guaranteeing fundamental motion safety without sacrificing the mobility of cars by treating the comfort box constraint as a semi-hard constraint in optimization via slack variables and penalty functions, which distinguishes our method from existing ones. Fourth, we demonstrate that our problem preserves convexity with the added constraints, thus global optimality of solutions is guaranteed. Fifth, we showcase how our formulation can be used in various autonomous driving scenarios by providing several challenging case studies in both static and dynamic environments. A range of numerical experiments and challenging realistic speed planning case studies have depicted that the proposed method outperforms existing speed planners for autonomous driving in terms of constraint type covered, optimality, safety, mobility and flexibility.


2009 ◽  
Author(s):  
Sallie J. Weaver ◽  
Rebecca Lyons ◽  
Eduardo Salas ◽  
David A. Hofmann

2008 ◽  
Author(s):  
Bradley C. Love ◽  
Matt Jones ◽  
Marc Tomlinson ◽  
Michael Howe

CICTP 2020 ◽  
2020 ◽  
Author(s):  
Kun Jiang ◽  
Yunlong Wang ◽  
Shengjie Kou ◽  
Diange Yang
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document