路径分析算法引擎比较 bing map vs google map

 

路径分析算法引擎比较 bing map vs google map

----by wangsh 2012-02-28

 

      最近痴迷于研究路径分析算法引擎,并已有初步成果,这里简单列出bing map与google map算法引擎比较。

      Bing map推出了最新的route engine(参考1),其中算法主要参考微软硅谷研究院的算法成果(参考2)。

      Google map是按照压缩分层算法进行路径分析的(参考3),个人推测其采用类似kit的CH算法(见参考4、参考5)。

     

(未完,待后面补充完整)

 

参考资料:

1.    Bing map new route engine : http://blog.csdn.net/wsh6759/article/details/7255643

2.    Customizable Route Planning: http://research.microsoft.com/apps/pubs/default.aspx?id=145688

文献 http://research.microsoft.com/pubs/145688/crp-sea.pdf

3.    The road to better path-finding : http://blog.csdn.net/wsh6759/article/details/7264838

4.    Contraction Hierarchies算法 http://en.wikipedia.org/wiki/Contraction_hierarchies   

5.    Contraction Hierarchies http://algo2.iti.kit.edu/documents/routeplanning/geisberger_dipl.pdf

 

 

 

 

转载请注明:http://blog.csdn.net/wsh6759/article/details/7302022

 

 

 

 

 

  • 1
    点赞
  • 14
    收藏
    觉得还不错? 一键收藏
  • 1
    评论
# RoutingKit [![Build Status](https://travis-ci.org/RoutingKit/RoutingKit.svg?branch=master)](https://travis-ci.org/RoutingKit/RoutingKit) RoutingKit is a C++ library that provides advanced route planning functionality. It was developed at [KIT](https://www.kit.edu) in the [group of Prof. Dorothea Wagner](https://i11www.iti.kit.edu/). The most prominent component is an index-based data structure called (Customizable) Contraction Hierarchy, that allows to answer shortest path queries within milliseconds or even less on data sets of continental size while keeping the arc weights flexible. Such running times cannot be achieved without indices. One of the main design goals of RoutingKit is to make recent research results easily accessible to people developing route planning applications. A key element is an interface that is a good compromise between usability and running time performance. For example the following code snippet is enough to build and query a basic index given an [OSM](https://www.openstreetmap.org) PBF data export. ```cpp #include <routingkit/osm_simple.h> #include <routingkit/contraction_hierarchy.h> #include <routingkit/inverse_vector.h> #include <routingkit/timer.h> #include <routingkit/geo_position_to_node.h> #include <iostream> using namespace RoutingKit; using namespace std; int main(){ // Load a car routing graph from OpenStreetMap-based data auto graph = simple_load_osm_car_routing_graph_from_pbf("file.pbf"); auto tail = invert_inverse_vector(graph.first_out); // Build the shortest path index auto ch = ContractionHierarchy::build( graph.node_count(), tail, graph.head, graph.travel_time ); // Build the index to quickly map latitudes and longitudes GeoPositionToNode map_geo_position(graph.latitude, graph.longitude); // Besides the CH itself we need a query object. ContractionHierarchyQuery ch_query(ch); // Use the query object to answer queries from stdin to stdout float from_latitude, from_longitude, to_latitude, to
# CRP Open source C++ Implementation of Customizable Route Planning (CRP) by Delling et al. This project was part of a practical course at Karlsruhe Institute of Technology (KIT). Requirements ============ In order to build CRP you need to have the following software installed: - Boost C++ Library (http://www.boost.org), more specifically Boost Iostreams. - Scons (http://scons.org) - g++ >= 4.8 (https://gcc.gnu.org) Building CRP ============ If the Boost Library is not in your PATH, make sure to edit the *SConstruct* file in the root directory to point the build script to the correct location of Boost. There is a section *Libraries* in the *SConstruct* file where you can specify the paths. Once you have installed all the software packages listed above, you can build the CRP programs by typing ``` scons --target=CRP --optimize=Opt -jX ``` into your terminal where `X` is the number of cores you want to use for building the project. If you want to use a specific g++ compiler version you can add `--compiler=g++-Version`. We also support a debug and profiling build that you can call with `--optimize=Dbg` and `--optimize=Pro` respectively. This command will build three programs in the folder *deploy*: - *osmparser*: Used to parse an OpenStreetMap (OSM) bz2-compressed map file. Call it with `./deploy/osmparser path_to_osm.bz2 path_to_output.graph.bz2` - *precalculation*: Used to build an overlay graph based on a given partition. Call it with `./deploy/precalculation path_to_graph path_to_mlp output_directory`. Here, *path_to_mlp* is the path to a *MultiLevelPartition* file for the graph that you need to provide. For more details, take a look into our project documentation. - *customization*: Used to precompute the metric weights for the overlay graph. Call it with `./deploy/customization path_to_graph path_to_overlay_graph metric_output_directory metric_type`. We currently support the following metric types: *hop* (number of edges traversed), *time* and *dist*.
RRT算法是一种基于采样的全局路径规划算法,可以应用于多维空间。它的目标是找到起点和目标位置之间的路径。在路径规划中,地图被表示为一个二维数组,其中每个元素代表一个空间点。 RRT算法的基本原理是通过随机采样和树的扩展来生成一个随机扩展树。它以一个初始点作为根节点,不断随机采样并通过增加叶子节点的方式扩展树。当树中的叶子节点包含了目标点或进入了目标区域时,可以通过回溯的方式在树中找到从初始点到目标点的路径。 需要注意的是,RRT算法找到的路径只是可行路径,并不一定是最优路径。并且当地图非常复杂时,RRT算法容易陷入死循环而无法找到路径。 因此,RRT算法是一种常用的路径规划算法,可以在多维空间中找到起点和目标位置之间的可行路径,但其结果可能不是最优且在复杂地图上可能会遇到困难。<span class="em">1</span><span class="em">2</span><span class="em">3</span> #### 引用[.reference_title] - *1* [利用RRT*完成迷宫环境下的最优路径规划](https://download.csdn.net/download/qq_42313095/28841347)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v93^chatsearchT3_2"}}] [.reference_item style="max-width: 33.333333333333336%"] - *2* [RRT路径规划算法](https://blog.csdn.net/qq_29320587/article/details/131300978)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v93^chatsearchT3_2"}}] [.reference_item style="max-width: 33.333333333333336%"] - *3* [RRT路径规划原理及演示代码](https://blog.csdn.net/qq_37705385/article/details/127373519)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v93^chatsearchT3_2"}}] [.reference_item style="max-width: 33.333333333333336%"] [ .reference_list ]

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值