Time Advancement and Bounds Intersection Checking for Faster Broad-Phase Collision Detection of Paired Object Trajectories
For self-driving mechanisms, the motion planning requires a reasonably fast algorithm for collision detection along the trajectories. We present three algorithms for the detection of collision among objects with predefined trajectories. The first algorithm uses the intersection of the path’s boundin...
Saved in:
Main Authors: | Fernandez, Proceso L, Jr, Germar, Mary Aveline |
---|---|
Format: | text |
Published: |
Archīum Ateneo
2018
|
Subjects: | |
Online Access: | https://archium.ateneo.edu/discs-faculty-pubs/86 https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1085&context=discs-faculty-pubs |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Ateneo De Manila University |
Similar Items
-
Faster broad-phase collission detection for motion planning
by: GERMAR, MARY AVELINE
Published: (2018) -
Faster broad-phase collission detection for motion planning
by: GERMAR, MARY AVELINE
Published: (2018) -
FastKLEE: faster symbolic execution via reducing redundant bound checking of type-safe pointers
by: TU, Haoxin, et al.
Published: (2022) -
Towards a Faster Incremental Packrat Parser
by: Guillermo, Jerwin Mark L, et al.
Published: (2019) -
Nonclassical trajectories in head-on collisions
by: Kumar, A., et al.
Published: (2022)