4894 search results - page 178 / 979 » Dynamic Abstraction Planning |
124
click to vote
TSMC
1998
15 years 3 months ago
1998
—We formulate and address the problem of planning a pushing manipulation by a mobile robot which tries to rearrange several movable objects in its work space. We present an algor...
171
click to vote
HYBRID
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Switching linear dynamic systems (SLDS) attempt to describe a complex nonlinear dynamic system with a succession of linear models indexed by a switching variable. Unfortu...
130
click to vote
EVOW
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. In this paper we propose a new benchmark problem for dynamic combinatorial optimisation. Unlike most previous benchmarks, we focus primarily on the underlying dynamics of...
140
click to vote
AIMSA
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....
177
click to vote
TCS
2011
14 years 11 months ago
2011
Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...