Sciweavers

1594 search results - page 58 / 319
» An Algorithm to Compute Collusion Paths
Sort
View
SI3D
2010
ACM
15 years 5 months ago
Real-time multi-agent path planning on arbitrary surfaces
Path planning is an active topic in the literature, and efficient navigation over non-planar surfaces is an open research question. In this work we present a novel technique for ...
Rafael P. Torchelsen, Luiz F. Scheidegger, Guilher...
DICTA
2003
15 years 1 months ago
Gesture Classification Using Hidden Markov Models and Viterbi Path Counting
Human-Machine interfaces play a role of growing importance as computer technology continues to evolve. Motivated by the desire to provide users with an intuitive gesture input syst...
Nianjun Liu, Brian C. Lovell
ICCSA
2007
Springer
15 years 6 months ago
Shortest Path Queries Between Geometric Objects on Surfaces
Abstract. We consider geometric shortest path queries between arbitrary pairs of objects on a connected polyhedral surface P of genus g. The query objects are points, vertices, edg...
Hua Guo, Anil Maheshwari, Doron Nussbaum, Jör...
TVCG
2008
138views more  TVCG 2008»
14 years 11 months ago
Real-Time Path Planning in Dynamic Virtual Environments Using Multiagent Navigation Graphs
We present a novel approach for efficient path planning and navigation of multiple virtual agents in complex dynamic scenes. We introduce a new data structure, Multiagent Navigatio...
Avneesh Sud, Erik Andersen, Sean Curtis, Ming C. L...
INFOCOM
1997
IEEE
15 years 4 months ago
Re-Routing in Circuit Switched Networks
Abstract—Dynamic routing has been adopted in circuit-switched networks in many parts of the world. Most of the routing algorithms used are least loaded routing (LLR) based for it...
Eric W. M. Wong, Andy K. M. Chan, Tak-Shing Peter ...