default search action
Patrick G. Xavier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [c13]Brian Hart, Derek Hart, Russell Gayle, Fred J. Oppel, Patrick G. Xavier, Jonathan Whetzel:
Dante Agent Architecture for Force-On-Force Wargame Simulation and Training. AIIDE 2017: 200-206 - 2016
- [j4]Glen Hansen
, Patrick G. Xavier, Sam P. Mish, Thomas E. Voth, Martin W. Heinstein, Micheal W. Glass:
An MPI+X implementation of contact global search using Kokkos. Eng. Comput. 32(2): 295-311 (2016)
2000 – 2009
- 2009
- [c12]Brandon Rohrer, Michael L. Bernard, J. Daniel Morrow, Fred Rothganger, Patrick G. Xavier:
Model-Free Learning and Control in a Mobile Robot. ICNC (5) 2009: 566-572 - 2008
- [c11]Donna Djordjevich, Patrick G. Xavier, Michael L. Bernard, Jonathan Whetzel, Matthew R. Glickman, Stephen J. Verzi
Preparing for the aftermath: Using emotional agents in game-based training for disaster response. CIG 2008: 266-275 - 2007
- [c10]Russell Gayle, Kristopher R. Klingler, Patrick G. Xavier:
Lazy Reconfiguration Forest (LRF) - An Approach for Motion Planning with Multiple Tasks in Dynamic Environments. ICRA 2007: 1316-1323 - 2002
- [c9]Patrick G. Xavier:
Implicit Convex-Hull Distance of Finite-Screw-Swept Volumes. ICRA 2002: 847-854 - [c8]Eric J. Gottlieb, Michael J. McDonald, Fred J. Oppel, J. Brian Rigdon, Patrick G. Xavier:
Plebes, dogs, and robots: the Umbra simulation framework as applied to building HLA federates. WSC 2002: 981-989
1990 – 1999
- 1999
- [c7]Patrick G. Xavier:
Shortest Path Planning for a Tethered Robot or an Anchored Cable. ICRA 1999: 1011-1017 - 1997
- [c6]Patrick G. Xavier:
Fast swept-volume distance for robust collision detection. ICRA 1997: 1162-1169 - 1996
- [c5]Patrick G. Xavier:
A generic algorithm for constructing hierarchical representations of geometric objects. ICRA 1996: 3644-3651 - 1995
- [j3]Bruce Randall Donald, Patrick G. Xavier:
Provably Good Approximation Algorithms for Optimal Kinodynamic Planning: Robots with Decoupled Dynamics Bounds. Algorithmica 14(6): 443-479 (1995) - [j2]Bruce Randall Donald, Patrick G. Xavier:
Provably Good Approximation Algorithms for Optimal Kinodynamic Planning for Cartesian Robots and Open-Chain Manipulators. Algorithmica 14(6): 480-530 (1995) - 1993
- [j1]Bruce Randall Donald, Patrick G. Xavier, John F. Canny, John H. Reif:
Kinodynamic Motion Planning. J. ACM 40(5): 1048-1066 (1993) - 1991
- [c4]Bruce Randall Donald, Patrick G. Xavier:
Time-safety trade-offs and a bang-bang algorithm for kinodynamic planning. ICRA 1991: 552-557 - 1990
- [c3]Bruce Randall Donald, Patrick G. Xavier:
Provably Good Approximation Algorithms for Optimal Kinodynamic Planning for Cartesian Robots and Open Chain Manipulators. SCG 1990: 290-300
1980 – 1989
- 1989
- [c2]Bruce Randall Donald, Patrick G. Xavier:
A provably good approximation algorithm for optimal-time trajectory planning. ICRA 1989: 958-963 - 1988
- [c1]John F. Canny, Bruce Randall Donald, John H. Reif, Patrick G. Xavier:
On the Complexity of Kinodynamic Planning. FOCS 1988: 306-316
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: