Different qualitative models have been proposed for decision under uncertainty in Artificial Intelli gence, but they generally fail to satisfy the princi ple of strict Pareto ...
Graphplan planning graphs are structures widely used in modern planners. The exclusion relations calculated in the planning graph extension provide very useful information, especi...
In this paper, we define a simple but scalable framework for peer-to-peer data sharing systems, in which the problem of answering queries over a network of semantically related p...
Traditional single-agent search algorithms usually make simplifying assumptions (single search agent, stationary target, complete knowledge of the state, and sufficient time). The...
Mark Goldenberg, Alexander Kovarsky, Xiaomeng Wu, ...
The iterative closest point (ICP) algorithm [2] is a popular method for modeling 3D objects from range data. The classical ICP algorithm rests on a rigid surface assumption. Build...