文章基本信息

标题：Optimal Path Search with User-Defined Queries
本地全文：下载
作者：Sravani Adusumilli ; S Ravi Kishan
期刊名称：International Journal of Innovative Research in Computer and Communication Engineering
印刷版ISSN：2320-9798
电子版ISSN：2320-9801
出版年度：2014
卷号：2
期号：11
出版社：S&S Publications
摘要：Nodes Most navigational apps, nowadays, merely find point-to-point route specifics and cannot handleintricate search scenarios. A more elaborate navigation method that has a route search with effective routes for complexqueries in heterogeneous environments, while dealing with uncertainties with regard to geographic entities wasdeveloped using Batch Forward Search (BFS) algorithm. Although BFS formulated a way to integrate these arbitraryconstraints into a specific route search, they may not be useful to the user. In realistic scenarios, the navigationalservice 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. Weextend the Batch Forward Search algorithm with Temporal Approximation Algorithm to handle temporal constraintsover route queries. We believe that proposed method will be effective and more elaborative compared to priorapproaches.
关键词：BFS; Constraints; Routes; Temporal; Queries