2. THE MASM ALGORITHM An input to the MASM algorithm is a time-annotated multi-agent action sequence. The action sequence is then transformed into an action graph. An action graph ...
Efficient algorithms for collision-free energy sub-optimal path planning for formations of spacecraft flying in deep space are presented. The idea is to introduce a set of way-poi...
(The original conference version of this paper mischaracterizes the contributions of the current authors, relative to the contributions of Keogh et al. [11, 12]. We would like to ...
In many computer graphics and computer-aided design problems, it is very common to find a smooth and well structured surface to fit a set of unstructured 3-dimensional data. Altho...
We study the problem of clustering uncertain objects whose locations are uncertain and described by probability density functions. We analyze existing pruning algorithms and experi...