首页> 外国专利> RECURSIVE, REAL-TIME CAPABLE, INTERACTION-AWARE METHODS OF PLANNING MOTIONS FOR AUTONOMOUS VEHICLES

RECURSIVE, REAL-TIME CAPABLE, INTERACTION-AWARE METHODS OF PLANNING MOTIONS FOR AUTONOMOUS VEHICLES

机译:递归,实时能力,自主车辆规划运动的交互方式

摘要

The invention is notably directed to computer-implemented method of planning motion of a vehicle. The method comprises receiving (S20) real-time signals as to positions of N traffic participants. At each time step of multiple time steps, the method plans (S50) motion for the vehicle by computing (S30) states of each of the N traffic participants according to the signals received (S20). Said states include current states, which are estimated for each of the N traffic participants, as well as future states of each of the participants, wherein the future states are predicted over a prediction horizon T. This is achieved using an interaction-aware model of the N traffic participants. This model is designed to cause the method to recursively compute (S32 - S38), at said each time step, the states of each of the N traffic participants according to a hierarchical list. The N traffic participants are ordered in the list from a most determinative one to a least determinative one of the N traffic participants. As a result, the states of the η-th participant in the list are computed based on the states of each of the η - 1 participants in the list, (formula (I)), This model is further designed to cause the method to update and sort (S40) the hierarchical list based on rules of the road, wherein the rules are evaluated based on the states of each of the N traffic participants as computed at said each time step. The invention is further directed to related computerized systems, vehicles, and computer program products.
机译:本发明特别涉及计划车辆的运动的计算机实现的方法。该方法包括接收(S20)实时信号作为N个交通参与者的位置。在多个时间步长每一个时间步,通过计算根据(S20)所接收的信号中的每个所述N个交通参与者的(S30)的状态的用于车辆的方法计划(S50)运动。所述状态包括当前状态,估计对于每个N个业务参与者,以及每个参与者,其中,所述未来状态的预测在预测范围T.这的未来状态使用的交互感知模型实现N个交通参与者。这种模式被设计为使得该方法递归地计算(S32 - S38),在所述每个时间步长,根据分级列表中的每个所述N个交通参与者的状态。 N个交通参与者在列表中从最决定性一个到N交通参与者的至少一个决定性有序。其结果是,在η个参与者的列表中的状态被基于每个η的的状态计算 - 1名参加者列表中的,(式(I)),该模型被进一步设计成使所述的方法来更新和排序(S40)基于所述道路的规则的分级列表,其中,所述规则是基于每个所述N个交通参与者的的状态评价为计算在所述每个时间步长。本发明还涉及相关的计算机系统,车辆,和计算机程序产品。

著录项

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号