Please use this identifier to cite or link to this item:
|Title:||Distributed memory bounded path search algorithms for pervasive computing environments||Authors:||Sundar, A.R.
Memory bounded search
|Issue Date:||2008||Citation:||Sundar, A.R.,Tan, C.K.-Y. (2008). Distributed memory bounded path search algorithms for pervasive computing environments. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 5351 LNAI : 394-404. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-540-89197-0_37||Abstract:||A pervasive computing environment consists typically of a large heterogeneous collection of networked devices which can acquire and reason on context information. Embedded devices are used extensively in pervasive environments but they face some key challenges. Common path searching algorithms like A*Search can have exponential number of node expansions. In this paper, we describe a special variant of this problem called Multiple Objective Path Search (MOPS) and propose a memory bounded solution to implement it in a pervasive environment. Experimental results show that an efficient path with 40-60 times less node expansions can be obtained with the proposed solution. © 2008 Springer Berlin Heidelberg.||Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||URI:||http://scholarbank.nus.edu.sg/handle/10635/41996||ISBN:||354089196X||ISSN:||03029743||DOI:||10.1007/978-3-540-89197-0_37|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 30, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.