Walking Route Recommender System Considering SAW Criteria

被引:15
作者
Sasaki, Wataru [1 ]
Takama, Yasufumi [1 ]
机构
[1] Tokyo Metropolitan Univ, Grad Sch Syst Design, Hino, Tokyo 1910065, Japan
来源
2013 CONFERENCE ON TECHNOLOGIES AND APPLICATIONS OF ARTIFICIAL INTELLIGENCE (TAAI) | 2013年
关键词
recommender systems; walking route recommendation; Open Street Map; RDF;
D O I
10.1109/TAAI.2013.56
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper proposes a walking route recommender system considering criteria for route safety, amenity and walkability. This paper refers to these criteria as SAW criteria. Walking is one of the easiest ways for health promotion, and a large number of people of all ages are enjoying it in various styles. As various people have different preference and health conditions, a walking rote recommender system has to provide them with a route considering various criteria, such as avoidance of steeps for elder people and existence of a coffee shop on route. However, existing route recommender systems usually employ only distance and necessary time between the current location and the specified location to make recommendations. This paper focuses on three criteria, including route safety, amenity and walkability, and proposes a method for recommending various routes considering these SAW criteria. In order to determine a route while considering such criteria, the proposed method combines A* algorithm and genetic algorithm. Another contribution of the system is to employ OSM (Open Street Map), which is converted into RDF (Resource Description Framework) and stored in SPARQL endpoint. Converting road information into RDF data makes it easy to extend database by incorporating various information about a road in future. This paper shows the proposed system is able to recommend reasonable and various routes through the simulations assuming users having various criteria and by subjective evaluation.
引用
收藏
页码:246 / 251
页数:6
相关论文
共 16 条
[1]  
[Anonymous], 2004, RESOURCE DESCRIPTION
[2]  
[Anonymous], 2013, SPARQL 1 1 QUER LANG
[3]   Named graphs [J].
Carroll, JJ ;
Bizer, C ;
Hayes, P ;
Stickler, P .
JOURNAL OF WEB SEMANTICS, 2005, 3 (04) :247-267
[4]  
Darken R.P., 1999, PRESENCE, V8, P3
[5]  
Goldberg, 1989, GENETIC ALGORITHMS S
[6]   A FORMAL BASIS FOR HEURISTIC DETERMINATION OF MINIMUM COST PATHS [J].
HART, PE ;
NILSSON, NJ ;
RAPHAEL, B .
IEEE TRANSACTIONS ON SYSTEMS SCIENCE AND CYBERNETICS, 1968, SSC4 (02) :100-+
[7]   Integrating uncomfortable intersection - Turns to subjectively optimal route selection using genetic algorithm [J].
Kambayashi, Yasushi ;
Yamachi, Hidemi ;
Tsujimura, Yasuhiro ;
Yamamoto, Hisashi .
ICCC 2007: 5TH IEEE INTERNATIONAL CONFERENCE ON COMPUTATIONAL CYBERNETICS, PROCEEDINGS, 2007, :203-+
[8]   Dynamic route planning for car navigation systems using virus genetic algorithms [J].
Kanoh, Hitoshi .
INTERNATIONAL JOURNAL OF KNOWLEDGE-BASED AND INTELLIGENT ENGINEERING SYSTEMS, 2007, 11 (01) :65-78
[9]  
Lovelace KL, 1999, LECT NOTES COMPUT SC, V1661, P65
[10]  
Lu Xin, 2010, P INT C MULT, P143, DOI [DOI 10.1145/1873951.1873972, 19.1145/1873951.1873972]