Asynchronous approach in the plane: a deterministic polynomial algorithm.
Sébastien BouchardMarjorie BournatYoann DieudonnéSwan DuboisFranck PetitPublished in: Distributed Comput. (2019)
Keyphrases
- experimental evaluation
- times faster
- computationally efficient
- learning algorithm
- objective function
- preprocessing
- input data
- dynamic programming
- worst case
- improved algorithm
- detection algorithm
- probabilistic model
- significant improvement
- search space
- computational complexity
- polynomially bounded
- three dimensional
- path planning
- matching algorithm
- computational cost
- optimization algorithm
- high accuracy
- np hard
- expectation maximization
- data structure
- convex hull
- data sets
- space complexity
- relaxation algorithm