首页> 外文会议>International Conference on Information and Communication Technologies >Toward An Intelligent Informative System to Determine Locations Paths in Doha City
【24h】

Toward An Intelligent Informative System to Determine Locations Paths in Doha City

机译:朝着智能信息系统确定多哈市的位置路径

获取原文

摘要

Tourists and new comers arriving to Doha city, the capital of Qatar, need always to know about specific locations (i.e., Tourist Sites, Hotels, Schools, Universities, Shopping Centers, Hospitals, Health Centres, Mosques, Sporting Clubs, etc.) and the possible routes leading to them. They are generally using static sources (i.e., Doha maps, brochures, diverse websites, etc) to get information about theses locations or they may ask others (i.e., residents, colleagues, passer-by). Even these information seem useful, they are however imprecise and will not fully satisfy the people requests and fulfill their incremental needs. An intelligent system helping these people to find quickly a location in Doha city is needed. Such a system will give detailed information about a specific location and determine the possible paths to reach it. People are always looking to save on time and resource (i.e., gas consumption, distances, time), therefore the system will be able to find the shortest routes leading to a specific location. In addition, it will help the potential users to plan a trip and visit a set of different locations within a limited period of time. Our system proposes routes leading to the user's destination and avoid passing thru locations with high accidents rates or heavy traffic. Doha city is divided into 71 different regions which are modeled by a weighted and connected graph. Each vertex of this graph represents a specific region, which, in turn, can be a sub-graph to allow internal search within the region. Dijkestra's algorithm is used to find the shortest paths between the regions. Information's about the regions are stored in a database for possible retrieval. The weight of the edge connecting two vertices represents the distance in KM between two regions.
机译:抵达卡塔尔首都多哈市的游客和新赛人,需要始终了解具体地点(即旅游景点,酒店,学校,大学,购物中心,医院,保健中心,清真寺,体育俱乐部等)和可能导致他们的路线。它们通常使用静态来源(即,多哈地图,宣传册,多样化的网站)来获取有关这些地点的信息,或者他们可能会问他人(即,居民,同事,路人)。即使这些信息似乎很有用,然而,它们不精确,不会完全满足人们要求并满足其增量需求。一个智能系统,帮助这些人在多哈城市中迅速找到一个位置。这样的系统将提供有关特定位置的详细信息,并确定要到达它的可能路径。人们总是希望节省时间和资源(即,煤气消耗,距离,时间),因此系统将能够找到通往特定位置的最短路线。此外,它还可以帮助潜在用户计划旅行并在有限的时间内访问一组不同的位置。我们的系统提出了通往用户目的地的路线,并避免通过高意外率或繁忙的地区通过地点。多哈市分为71个不同地区,由加权和连接的图表建模。该图的每个顶点代表特定区域,又可以是允许该区域内部搜索的子图。 Dijkestra的算法用于找到区域之间的最短路径。信息的关于区域的信息存储在数据库中以进行检索。连接两个顶点的边缘的重量表示两个区域之间的距离。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号