Patrick G. Xavier

According to our database1, Patrick G. Xavier authored at least 16 papers between 1988 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2017
Dante Agent Architecture for Force-On-Force Wargame Simulation and Training.
Proceedings of the Thirteenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE-17), 2017

2016
An MPI+X implementation of contact global search using Kokkos.
Eng. Comput., 2016

2009
Model-Free Learning and Control in a Mobile Robot.
Proceedings of the Fifth International Conference on Natural Computation, 2009

2008
Preparing for the aftermath: Using emotional agents in game-based training for disaster response.
Proceedings of the 2008 IEEE Symposium on Computational Intelligence and Games, 2008

2007
Lazy Reconfiguration Forest (LRF) - An Approach for Motion Planning with Multiple Tasks in Dynamic Environments.
Proceedings of the 2007 IEEE International Conference on Robotics and Automation, 2007

2002
Plebes, dogs, and robots: the Umbra simulation framework as applied to building HLA federates.
Proceedings of the 34th Winter Simulation Conference: Exploring New Frontiers, 2002

Implicit Convex-Hull Distance of Finite-Screw-Swept Volumes.
Proceedings of the 2002 IEEE International Conference on Robotics and Automation, 2002

1999
Shortest Path Planning for a Tethered Robot or an Anchored Cable.
Proceedings of the 1999 IEEE International Conference on Robotics and Automation, 1999

1997
Fast swept-volume distance for robust collision detection.
Proceedings of the 1997 IEEE International Conference on Robotics and Automation, 1997

1996
A generic algorithm for constructing hierarchical representations of geometric objects.
Proceedings of the 1996 IEEE International Conference on Robotics and Automation, 1996

1995
Provably Good Approximation Algorithms for Optimal Kinodynamic Planning for Cartesian Robots and Open-Chain Manipulators.
Algorithmica, 1995

Provably Good Approximation Algorithms for Optimal Kinodynamic Planning: Robots with Decoupled Dynamics Bounds.
Algorithmica, 1995

1993
Kinodynamic Motion Planning.
J. ACM, 1993

1991
Time-safety trade-offs and a bang-bang algorithm for kinodynamic planning.
Proceedings of the 1991 IEEE International Conference on Robotics and Automation, 1991

1989
A provably good approximation algorithm for optimal-time trajectory planning.
Proceedings of the 1989 IEEE International Conference on Robotics and Automation, 1989

1988
On the Complexity of Kinodynamic Planning
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988


  Loading...