Coverage and mobile sensor placement for vehicles on predetermined routes: a greedy heuristic approach

Ali, Junade; Dyo, Vladimir

dc.contributor.author	Ali, Junade	en
dc.contributor.author	Dyo, Vladimir	en
dc.date.accessioned	2017-08-02T09:11:43Z
dc.date.available	2017-08-02T09:11:43Z
dc.date.issued	2017-07-28
dc.identifier.citation	Proceedings of the 14th International Joint Conference on e-Business and Telecommunications - Volume 5: WINSYS, (ICETE 2017) pp83-88	en
dc.identifier.isbn	9789897582615
dc.identifier.doi	10.5220/0006469800830088
dc.identifier.uri	http://hdl.handle.net/10547/622159
dc.description.abstract	Road potholes are not only nuisance but can also damage vehicles and pose serious safety risks for drivers. Recently, a number of approaches have been developed for automatic pothole detection using equipment such as accelerometers, image sensors or LIDARs. Mounted on vehicles, such as taxis or buses, the sensors can automatically detect potholes as the vehicles carry out their normal operation. While prior work focused on improving the performance of a standalone device, it simply assumed that the sensors would be installed on the entire fleet of vehicles. When the number of sensors is limited it is important to select an optimal set of vehicles to make sure that they do not cover similar routes in order to maximize the total coverage of roads inspected by sensors. The paper investigates this problem for vehicles that follow pre-determined routes, formulates it as a linear optimization problem and proposes a solution based on a greedy heuristic. The proposed approach has been tested on an official London bus route dataset containing 713 routes and showed up to 78% improvement compared to a random sensor placement selected as a baseline algorithm.
dc.language.iso	en	en
dc.publisher	SCITEPRESS – Science and Technology Publications	en
dc.relation.url	https://www.scitepress.org/Link.aspx?doi=10.5220/0006469800830088
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/4.0/	*
dc.subject	mobile sensors	en
dc.subject	intelligent transportation systems	en
dc.subject	smart cities	en
dc.subject	optimal route selection	en
dc.subject	set cover problem	en
dc.subject	H131 Automated Engineering Design	en
dc.title	Coverage and mobile sensor placement for vehicles on predetermined routes: a greedy heuristic approach	en
dc.title.alternative	In Proceedings of the 14th International Joint Conference on e-Business and Telecommunications (ICETE 2017) - Volume 6: WINSYS	en
dc.type	Conference papers, meetings and proceedings	en
dc.date.updated	2017-08-02T09:09:08Z
html.description.abstract	Road potholes are not only nuisance but can also damage vehicles and pose serious safety risks for drivers. Recently, a number of approaches have been developed for automatic pothole detection using equipment such as accelerometers, image sensors or LIDARs. Mounted on vehicles, such as taxis or buses, the sensors can automatically detect potholes as the vehicles carry out their normal operation. While prior work focused on improving the performance of a standalone device, it simply assumed that the sensors would be installed on the entire fleet of vehicles. When the number of sensors is limited it is important to select an optimal set of vehicles to make sure that they do not cover similar routes in order to maximize the total coverage of roads inspected by sensors. The paper investigates this problem for vehicles that follow pre-determined routes, formulates it as a linear optimization problem and proposes a solution based on a greedy heuristic. The proposed approach has been tested on an official London bus route dataset containing 713 routes and showed up to 78% improvement compared to a random sensor placement selected as a baseline algorithm.