TY - JOUR
T1 - The weighted shortest path search based on multi-agents in mobile GIS management services
AU - Peng, Min
AU - Xiong, Naixue
AU - Park, Jong Hyuk
AU - Vasilakos, Athanasios V.
AU - Zhang, Jiawen
PY - 2012/3
Y1 - 2012/3
N2 - In this paper we focus on the mobile GIS management system based on multi-agents, and wider range of client devices with J2ME-MIDP kernel are supported in it. A kit (Map Database Manager) is developed and described in detail. The kit can convert GIS data of commercial formats such as ArcGIS and Mapinfo into Geospatial data in GML, and provide Geospatial data for handheld devices freely without commercial plug-in software. A peer to peer multi-agents mechanism on mobile GIS services is the main subject of this paper. According to user's requirement and known buffer area radius on map, agent can define the factors to calculate the optimal path from one node to target node in a map, which considers not only the length of the road but also traffic flow, road cost, and other factors. We use the integrated cost to re-define the road path weights, and select the optimal path among the road based on the minimum weight. The actual experimental results shown that in the quantified traffic flow and road condition, from node to other target nodes, we can get an optimal path on map, which satisfies the condition mostly. The results can greatly assist the searching of the optimal path in GIS services.
AB - In this paper we focus on the mobile GIS management system based on multi-agents, and wider range of client devices with J2ME-MIDP kernel are supported in it. A kit (Map Database Manager) is developed and described in detail. The kit can convert GIS data of commercial formats such as ArcGIS and Mapinfo into Geospatial data in GML, and provide Geospatial data for handheld devices freely without commercial plug-in software. A peer to peer multi-agents mechanism on mobile GIS services is the main subject of this paper. According to user's requirement and known buffer area radius on map, agent can define the factors to calculate the optimal path from one node to target node in a map, which considers not only the length of the road but also traffic flow, road cost, and other factors. We use the integrated cost to re-define the road path weights, and select the optimal path among the road based on the minimum weight. The actual experimental results shown that in the quantified traffic flow and road condition, from node to other target nodes, we can get an optimal path on map, which satisfies the condition mostly. The results can greatly assist the searching of the optimal path in GIS services.
KW - handheld device
KW - mobile GIS
KW - multi-agents
KW - optimal path search
UR - https://www.scopus.com/pages/publications/84863151863
U2 - 10.1002/wcm.962
DO - 10.1002/wcm.962
M3 - Article
AN - SCOPUS:84863151863
SN - 1530-8669
VL - 12
SP - 302
EP - 317
JO - Wireless Communications and Mobile Computing
JF - Wireless Communications and Mobile Computing
IS - 4
ER -