Optimal planner switch method for three point turn of autonomous driving vehicles

    公开(公告)号:US11338855B2

    公开(公告)日:2022-05-24

    申请号:US16314352

    申请日:2018-12-26

    发明人: Lin Ma Fan Zhu Xin Xu

    IPC分类号: B62D15/02 B60W30/18 G01C21/34

    摘要: A three-point-turn is planned and executed in the operation of an autonomous driving vehicle (ADV). A candidate route from a start point and going through an end point is determined, the start point and the end point being in lanes associated with opposite travel directions. The candidate route is categorized into partially overlapping first, second, and third segments. A total cost associated with the candidate route is determined based at least in part on the first and second segments. Whether the total cost is below a threshold cost is determined. In response to a determination that the total cost is below the threshold cost, the three-point-turn is planned based on the candidate route. Further, driving signals are generated based at least in part on the planned three-point-turn to control operations of the ADV.

    NEURAL ARCHITECTURE SEARCH VIA SIMILARITY-BASED OPERATOR RANKING

    公开(公告)号:US20220092381A1

    公开(公告)日:2022-03-24

    申请号:US17058624

    申请日:2020-09-18

    IPC分类号: G06N3/04 G06N3/08

    摘要: Network architecture search (NAS) received a lot of attention. The supernet-based differentiable approach is popular because it can effectively share the weights and lead to more efficient search. However, the mismatch between the architecture and weights caused by weight sharing still exists. Moreover, the coupling effects among different operators are also neglected. To alleviate these problems, embodiments of an effective NAS methodology by similarity-based operator ranking are presented herein. With the aim of approximating each layer's output in the supernet, a similarity-based operator ranking based on statistical random comparison is used. In one or more embodiments, then the operator that possibly causes the least change to feature distribution discrepancy is pruned. In one or more embodiments, a fair sampling process may be used to mitigate the operators' Matthew effect that happened frequently in previous supernet approaches.

    METHOD FOR ALIGNING TEXT WITH MEDIA MATERIAL, APPARATUS AND STORAGE MEDIUM

    公开(公告)号:US20220083741A1

    公开(公告)日:2022-03-17

    申请号:US17538932

    申请日:2021-11-30

    摘要: A method for aligning a text with a media material, an apparatus, and a storage medium are provided. The method includes: determining a set of anchor points in the text; performing following operations i) to v) repeatedly until all anchor points are removed from the set of anchor points or all media materials are removed from a set of media materials: i) ranking the anchor points in the set of anchor points, ii) selecting a target anchor point from the set of anchor points based on the ranked anchor points in the set, iii) determining, from the set of media materials, a media material matching a text segment starting from the target anchor point, iv) removing the target anchor point, and v) removing the media material matching the text segment starting from the target anchor point; and aligning the text segments with respective media matching materials.

    Map-less and camera-based lane markings sampling method for level-3 autonomous driving vehicles

    公开(公告)号:US11267476B2

    公开(公告)日:2022-03-08

    申请号:US16338447

    申请日:2019-03-28

    发明人: Xin Xu Fan Zhu Lin Ma

    摘要: A computer-implemented method, apparatus, and system for discretizing lane markings and for generating a lane reference line is disclosed. A polynomial defined over an (x,y) coordinate system is received, the polynomial being representative of at least a portion of a lane boundary line. A length of the polynomial is determined. The polynomial is discretized, comprising determining a plurality of discretization points on the polynomial to represent the polynomial, wherein a first discretization point is a first end of the polynomial, wherein subsequent discretization points are determined successively until the polynomial is completely discretized, and wherein each discretization point other than the first discretization point is determined based at least in part on a slope of the polynomial at a previous discretization point. Thereafter, a lane reference line comprising a plurality of points is generated based on the discretized polynomial.