Abstrait

Optimal Path Search with User-Defined Queries

Sravani Adusumilli1, S Ravi Kishan

Nodes Most navigational apps, nowadays, merely find point-to-point route specifics and cannot handle intricate search scenarios. A more elaborate navigation method that has a route search with effective routes for complex queries in heterogeneous environments, while dealing with uncertainties with regard to geographic entities was developed using Batch Forward Search (BFS) algorithm. Although BFS formulated a way to integrate these arbitrary constraints into a specific route search, they may not be useful to the user. In realistic scenarios, the navigational service provider should consider additional complicating factors such as the working hours of the entities to be visited, type of service those entities cater to and possible restrictions on the order by which the entities may be visited. We extend the Batch Forward Search algorithm with Temporal Approximation Algorithm to handle temporal constraints over route queries. We believe that proposed method will be effective and more elaborative compared to prior approaches.