Sciweavers

33 search results - page 3 / 7
» Probabilistic Modeling of Mobile Agents' Trajectories
Sort
View
AAAI
2008
13 years 7 months ago
Maximum Entropy Inverse Reinforcement Learning
Recent research has shown the benefit of framing problems of imitation learning as solutions to Markov Decision Problems. This approach reduces learning to the problem of recoveri...
Brian Ziebart, Andrew L. Maas, J. Andrew Bagnell, ...
PAMI
2010
273views more  PAMI 2010»
13 years 4 days ago
Correspondence-Free Activity Analysis and Scene Modeling in Multiple Camera Views
We propose a novel approach for activity analysis in multiple synchronized but uncalibrated static camera views. In this paper, we refer to activities as motion patterns of objects...
Xiaogang Wang, Kinh Tieu, W. Eric L. Grimson
WDAG
2007
Springer
92views Algorithms» more  WDAG 2007»
13 years 11 months ago
Self-stabilizing Counting in Mobile Sensor Networks with a Base Station
Abstract. Distributed computing must adapt its techniques to networks of mobile agents. Indeed, we are facing new problems like the small size of memory and the lack of computation...
Joffroy Beauquier, Julien Clement, Stéphane...
ICRA
2006
IEEE
131views Robotics» more  ICRA 2006»
13 years 11 months ago
A Practical Algorithm for Network Topology Inference
— When a network of robots or static sensors is emplaced in an environment, the spatial relationships between the sensing units must be inferred or computed for most key applicat...
Dimitri Marinakis, Gregory Dudek
AAAI
2004
13 years 6 months ago
Analogical Path Planning
We present a probabilistic method for path planning that considers trajectories constrained by both the environment and an ensemble of restrictions or preferences on preferred mot...
Saul Simhon, Gregory Dudek