Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jason Hardy

dblp:60/10004 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 first-authorSystems, architecture and hardware · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Motion planning and robot control · 77% Planning, search and constraint satisfaction · 23%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control
collision avoidance
0.212013
Contingency Planning Over Probabilistic Obstacle Predictions for Autonomous Road Vehicles · IEEE Trans. Robotics 2013
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning under uncertainty
contingency planning
0.212013
Contingency Planning Over Probabilistic Obstacle Predictions for Autonomous Road Vehicles · IEEE Trans. Robotics 2013
Robotics › Motion planning and robot control
motion planning
0.212013
Contingency Planning Over Probabilistic Obstacle Predictions for Autonomous Road Vehicles · IEEE Trans. Robotics 2013
Robotics › Motion planning and robot control › collision avoidance
probabilistic collision avoidance
0.212013
Contingency Planning Over Probabilistic Obstacle Predictions for Autonomous Road Vehicles · IEEE Trans. Robotics 2013
Robotics › Motion planning and robot control
trajectory optimization
0.012013
Contingency Planning Over Probabilistic Obstacle Predictions for Autonomous Road Vehicles · IEEE Trans. Robotics 2013

Methods — techniques the papers use, named apart from their topics

trajectory clustering · 0.2spline-based trajectory representation · 0.2collision probability bounds · 0.2
YearPublicationVenuePosition
2013 Contingency Planning Over Probabilistic Obstacle Predictions for Autonomous Road Vehicles
abstract
This paper presents a novel optimization-based path planner that is capable of planning multiple contingency paths to directly account for uncertainties in the future trajectories of dynamic obstacles. This planner addresses the particular problem of probabilistic collision avoidance for autonomous road vehicles that are required to safely interact, in close proximity, with other vehicles with unknown intentions. The presented path planner utilizes an efficient spline-based trajectory representation and fast but accurate collision probability bounds to simultaneously optimize multiple continuous contingency paths in real time. These collision probability bounds are efficient enough for real-time evaluation, yet accurate enough to allow for practical close-proximity driving behaviors such as passing an obstacle vehicle in an adjacent lane. An obstacle trajectory clustering algorithm is also presented to enable the path planner to scale to multiple-obstacle scenarios. Simulation results show that the contingency planner allows for a more aggressive driving style than planning a single path without compromising the overall safety of the robot.
Jason Hardy, Mark E. Campbell
IEEE Trans. Robotics1
2011 Clustering obstacle predictions to improve contingency planning for autonomous road vehicles in congested environments
abstract
A hierarchical trajectory clustering algorithm is presented with the goal of clustering a set of mutually exclusive obstacle trajectory predictions for use in a contingency based path planner for an autonomous road vehicle. This clustering algorithm improves the computational scaling of the contingency planner by limiting the total number of required contingency paths while preserving the performance advantages of exhaustive contingency planning. This algorithm seeks to maximize dissimilarity between trajectory clusters with regard to their potential effect on a robot's future path. Simulation results show that the clustering algorithm allows a robot to maintain many of the benefits of contingency planning while requiring fewer contingency paths.
Jason Hardy, Mark E. Campbell
IROS1
2010 Contingency planning over probabilistic hybrid obstacle predictions for autonomous road vehicles
abstract
This paper presents a novel optimization based path planner that can simultaneously plan multiple contingency paths to account for the uncertain actions of dynamic obstacles. This planner addresses the particular problem of collision avoidance for autonomous road vehicles which are required to safely interact with other vehicles with unknown intentions. The presented path planner utilizes an efficient spline based trajectory representation and fast but accurate collision probability approximations to enable the simultaneous optimization of multiple contingency paths.
Jason Hardy, Mark E. Campbell
IROS1