algorithms Directory Reference

Directory dependency graph for algorithms:

Files
	abstract_controller.h
	Contains the abstract class for coverage control algorithms.
	centralized_cvt.h
	Contains the class CentralizedCVT.
	clairvoyant_cvt.h
	Clairvoyant CVT algorithm.
	decentralized_cvt.h
	Contains the DecentralizedCVT class.
	near_optimal_cvt.h
	NearOptimalCVT class Global offline oracle: has complete information about the environment. Use full communication between robots. Tries multiple random sites for initial locations. Uses Hungarian algorithm to assign robots to goal positions.
	near_optimal_cvt_algorithm.h
	Near Optimal Centroidal Voronoi Tessellation (CVT) algorithm Near-optimal Centroidal Voronoi Tessellation (CVT) algorithms. The algorithm has knowledge of the entire map in a centralized manner. It spawns random sites and iteratively moves them to the centroid of the Voronoi cell, until convergence. Hungarian algorithm is used to assign the robots to the sites. Out of the multiple tries, the best Voronoi is selected based on the objective function.
	oracle_bang_explore_exploit.h
	First trial of oracle with exploration and exploitation. The oracle uses complete information about the environment.
	oracle_explore_exploit.h
	Old trial of exploration and exploitation Uses system map for exploration as well.
	simul_explore_exploit.h
	Simultaneous exploration and exploitation algorithm Uses frontier-based exploration with bias towards IDF. Robots switch between exploration and exploitation modes. Exploitation is done locally in a decentralized manner while respecting communation constraints.