Heiko Schilling
Köln, Nordrhein-Westfalen, Deutschland
30.602 Follower:innen
500+ Kontakte
Info
I'm Heiko Schilling, Senior Vice President of Software and AI Engineering at Stellantis…
Artikel von Heiko Schilling
-
TomTom and BMW Motorrad know motorcycle drivers are a lot like car drivers...except when they're not.
TomTom and BMW Motorrad know motorcycle drivers are a lot like car drivers...except when they're not.
Von Heiko Schilling
Aktivitäten
-
Von wegen: Wenn man die Speicherkosten dazu rechnet, ist Solarstrom teurer als konventioneller Strom. Eine aktuelle Studie kommt zu dem Ergebnis:…
Von wegen: Wenn man die Speicherkosten dazu rechnet, ist Solarstrom teurer als konventioneller Strom. Eine aktuelle Studie kommt zu dem Ergebnis:…
Beliebt bei Heiko Schilling
-
Chinese car makers are poised to take over the developing world. This means export volumes could be hit for carmakers from the developed…
Chinese car makers are poised to take over the developing world. This means export volumes could be hit for carmakers from the developed…
Beliebt bei Heiko Schilling
Berufserfahrung
Ausbildung
-
University of Cambridge
-
Activities and Societies: Wolfson College Cambridge
"The Cambridge Executive MBA is designed specifically for executives who have already reached a senior level, and are now looking at leading roles within their organisations. The programme develops both hard and soft skills, and provides practical, relevant knowledge to enable you to play a leading role in your organisation."
http://www.jbs.cam.ac.uk/programmes/executivemba/ -
-
Supervisors: Prof. Dr. Rolf H. Möhring, Prof. Dr. Kai Nagel, and Dr. Thomas Erlebach
“I regard his [Heiko’s PhD] thesis as an excellent prototype for the successful integration of theory and practice that sets a landmark in the literature for both practitioners and theoretically oriented researchers. [...] he developed a surprisingly deep and broad knowledge of all areas relating traffic routing, among them graph theory, mathematical programming and the analysis and design of algorithms.…Supervisors: Prof. Dr. Rolf H. Möhring, Prof. Dr. Kai Nagel, and Dr. Thomas Erlebach
“I regard his [Heiko’s PhD] thesis as an excellent prototype for the successful integration of theory and practice that sets a landmark in the literature for both practitioners and theoretically oriented researchers. [...] he developed a surprisingly deep and broad knowledge of all areas relating traffic routing, among them graph theory, mathematical programming and the analysis and design of algorithms. His advice and opinion are appreciated by many colleagues throughout the world, and his thesis has brought him immediately to a senior position in the research and development division of TomTom.”, Prof. Dr. Rolf H Möhring, TU Berlin, Germany -
-
Worked within a leading research team (Prof. Dr. Kai Nagel) on optimised route assignments
in large scale multi-agent micro-simulations
Worked with Dr. Thomas Erlebach and his team on solutions for long-standing open research problems arising in the area of constrained network flows -
-
Thesis: ”Downwind numbering for pre-condition convection dominated problems”
Developed numbering strategies to speedup solvers for large equality systems
Areas of concentration: optimisation, algorithms and complexity, numerical analysis, and statistics -
-
Worked on parallel shortest-path-algorithms with Prof. Bill McColl
Member of Somerville College, Oxford -
-
-
-
Bescheinigungen und Zertifikate
-
Briggs-Meyers personality test: ESTP - Extraverted (17%) Sensing (2%) Thinking (15%) Perceiving (5%)
http://www.cpp.com
Ausgestellt: -
Briggs-Meyers personality test: ENTP - Extraverted (44%) iNtuitive (12%) Thinking (12%) Perceiving (67%)
http://www.humanmetrics.com
Ausgestellt: -
Ehrenamt
-
Civil Service Volunteer
Eine-Welt-Laden, Struth, Rodeberg, Germany
- 1 Jahr
Economic Empowerment
- Helped building up a carpentry workshop in Mozambique, Africa
- Run a fairtrade good shop in Germany
Veröffentlichungen
-
Length-Bounded Cuts and Flows
ACM Transactions on Algorithms, Vol. 7, No. 1, Article 4
For a given number L, an L-length-bounded edge-cut (node-cut, respectively) in a graph G with source s and sink t is a set C of edges (nodes, respectively) such that no s-t-path of length at most L remains in the graph after removing the edges (nodes, respectively) in C. An L-length-bounded flow is a flow that can be decomposed into flow paths of length at most L. In contrast to classical flow theory, we describe instances for which the minimum L-length-bounded edge-cut (node-cut, respectively)…
For a given number L, an L-length-bounded edge-cut (node-cut, respectively) in a graph G with source s and sink t is a set C of edges (nodes, respectively) such that no s-t-path of length at most L remains in the graph after removing the edges (nodes, respectively) in C. An L-length-bounded flow is a flow that can be decomposed into flow paths of length at most L. In contrast to classical flow theory, we describe instances for which the minimum L-length-bounded edge-cut (node-cut, respectively) is Θ(n2/3)-times (Θ(&sqrt;n)-times, respectively) larger than the maximum L-length-bounded flow, where n denotes the number of nodes; this is the worst case. We show that the minimum length-bounded cut problem is NP-hard to approximate within a factor of 1.1377 for L≥ 5 in the case of node-cuts and for L≥ 4 in the case of edge-cuts. We also describe algorithms with approximation ratio O(min{L,n/L}) ⊆ O&sqrt;n in the node case and O(min {L,n2/L2,&sqrt;m} ⊆ O2/3 in the edge case, where m denotes the number of edges. Concerning L-length-bounded flows, we show that in graphs with unit-capacities and general edge lengths it is NP-complete to decide whether there is a fractional length-bounded flow of a given value. We analyze the structure of optimal solutions and present further complexity results.
Andere Autor:innenVeröffentlichung anzeigen -
Fast Point-to-Point Shortest Path Computations with Arc-Flags
In book: The Shortest Path Problem: Ninth DIMACS Implementation Challenge, volume 74 of DIMACS Book, Publisher: American Mathematical Society, Editors: Camil Demetrescu, Andrew V. Goldberg and David S. Johnson, pp.41-72
In this paper, we conduct a detailed study of the arc-flag approach introduced in [Lau97, Lau04]. Arc-flags are a modification of Dijkstra’s algorithm to accelerate point-to-point (p2p) shortest path computations. The usage of arc-flags avoids exploring unnecessary paths during shortest path query computations. We present two improvements of the original arc-flag method that reduce the pre-calculation times significantly, tweak the efficiency of queries, and cut down the space requirements…
In this paper, we conduct a detailed study of the arc-flag approach introduced in [Lau97, Lau04]. Arc-flags are a modification of Dijkstra’s algorithm to accelerate point-to-point (p2p) shortest path computations. The usage of arc-flags avoids exploring unnecessary paths during shortest path query computations. We present two improvements of the original arc-flag method that reduce the pre-calculation times significantly, tweak the efficiency of queries, and cut down the space requirements. First, we improve the preprocessing of the arc-flags by introducing a centralized shortest path algorithm and thereby we overcome the main drawback of the arc-flag method: for the first time it is now possible to apply the pure arc-flag method to large networks such as continental road networks (US network: 24M nodes, 58M edges). Second, we improve the partitioning used in our revised arc-flag method by using multi-way arc separators. Thereby we almost doubled the efficiency of queries on some instances compared to [Lau06] and further reduced the space requirements. This achievement stresses the vital importance of the right choice of partitioning for the performance of the arc-flag method. On the US network, our revised arc-flag method requires only between 4.1 and 15.5 bytes of additional preprocessed data per arc and p2p queries can be answered within 3 to 9 milliseconds (depending on the metric and the underlying partitioning). These results make our revised arc-flags method the currently best-performing purely goal-directed approach. Without having to use combinations with other advanced acceleration techniques or any network compression method we have kept the modification of Dijkstra’s original algorithm minimal—literally only one additional line of code in the route search algorithm needs to be implemented. Its simplicity suggests its usage in existing code bases of route finding applications—whether that be website routers, mobile phones, or personal navigation devices.
Andere Autor:innenVeröffentlichung anzeigen -
Optimizing the Cargo Express Service of Swiss Federal Railways
INFORMS Transportation Science, Vol. 42, No. 4, pp. 450–465
The Cargo Express service of Swiss Federal Railways (SBB Cargo) offers fast overnight transportation of goods between selected train stations in Switzerland and is operated as a hub-and-spoke system with two hubs. We present three different models for planning the operation of this service as a whole. All models capture the underlying optimization problem with a high level of detail: Traffic routing, train routing, makeup, scheduling, and locomotive assignment are all addressed. At the same…
The Cargo Express service of Swiss Federal Railways (SBB Cargo) offers fast overnight transportation of goods between selected train stations in Switzerland and is operated as a hub-and-spoke system with two hubs. We present three different models for planning the operation of this service as a whole. All models capture the underlying optimization problem with a high level of detail: Traffic routing, train routing, makeup, scheduling, and locomotive assignment are all addressed. At the same time we respect hard constraints like tight service time windows and train capacities, and we avoid hub overloading. We describe our approaches for obtaining provably good quality solutions. Our algorithmic techniques involve branch-and-cut, branch-and-price, and problem-specific exact and heuristic acceleration methods. We conclude our study with computational results on realistic data.
Andere Autor:innenVeröffentlichung anzeigen -
Fast point-to-point shortest path computations with arc-flags
The Ninth DIMACS Implementation Challenge: The Shortest Path Problem
We present a number of improvements of the basic variant of the arc-flag acceleration (Lauther, 1997, 2004) for point-to-point (P2P) shortest path computations on large graphs. Arc-flags are a modification to the standard Dijkstra algorithm and are used to avoid exploring unnecessary paths during shortest path computation.We assume that for the same input graph the shortest path problem has to be solved repeatedly for different node pairs. Thus, precomputing the arc-flags is possible. We show…
We present a number of improvements of the basic variant of the arc-flag acceleration (Lauther, 1997, 2004) for point-to-point (P2P) shortest path computations on large graphs. Arc-flags are a modification to the standard Dijkstra algorithm and are used to avoid exploring unnecessary paths during shortest path computation.We assume that for the same input graph the shortest path problem has to be solved repeatedly for different node pairs. Thus, precomputing the arc-flags is possible. We show that the improved arc-flag acceleration achieves speedups of P2P shortest path queries of more than 1,470 on a subnetwork of the German road network1 with 1M node and 2.5M arcs using 450 bits of additional information per arc. The acceleration factors increase with the size of the input graph. Finally, we present an improved preprocessing version which allows precomputing arc-flags for European and North-American road networks within hours.
Andere Autor:innen -
-
Route Assignment Problems IN LARGE NETWORKS
PhD, TU Berlin
FAST ROUTE PLANNING: We presented a number of improvements of the basic variant of the arc-flag acceleration (Lauther, 1997, 2004) for speeding up the P2P shortest path search on static networks. Arc flags are a modification to the standard Dijkstra algorithm and are used to avoid exploring unnecessary paths during shortest path computation. We showed that the improved arc-flags achieve speedups of P2P shortest path queries of more than 1,470 on a subnetwork of the German road network with 1M…
FAST ROUTE PLANNING: We presented a number of improvements of the basic variant of the arc-flag acceleration (Lauther, 1997, 2004) for speeding up the P2P shortest path search on static networks. Arc flags are a modification to the standard Dijkstra algorithm and are used to avoid exploring unnecessary paths during shortest path computation. We showed that the improved arc-flags achieve speedups of P2P shortest path queries of more than 1,470 on a subnetwork of the German road network with 1M node and 2.5M arcs using 450 bits of additional information per arc.
LOAD-BALANCED ROUTE PLANNING: We introduced an innovative model for flows over time, which captures the behavior of cars traveling through a road network better than previous models working with inflow-dependent or load-dependent transit times. Our new model is called the Rate-Dependent model. It describes the dependence of travel speed on the current flow situation: the maximal possible speed at any position on an arc, at any point in time, always depends directly on the current flow rate. We showed that computing an optimal solution in the new model is NP-hard and we presented an LP-based algorithm which we evaluated with several experiments on real world data of road networks and generated requests.
NETWORK FLOWS: We presented a number of results concerning the complexity and approximability of length-bounded cut and flow problems. We showed that the minimum length-bounded cut problem in graphs with unit edge lengths is NP-hard to approximate within a factor of at least 1.1377 for L ≥ 5 in the case of node-cuts and for L ≥ 4 in the case of edge-cuts. For L = n−c, where c ∈ N is an arbitrary constant, a minimum length-bounded node-cut can be computed in polynomial time in (un-)directed graphs. Our results improve the results in (Lovász et al., 1978) and in (Mahjoub and McCormick, 2003). -
Optimal Route Assignments in Large Scale Micro-Simulations
Technical Report, No. 2006/014, TU Berlin
Traffic management and route guidance are optimization problems by nature. In this article, we consider algorithms for centralized route guidance and discuss fairness aspects for the individual user resulting from optimal route guidance policies. The first part of this article deals with the mathematical aspects of these optimization problems from the viewpoint of network flow theory.We present algorithms which solve the constrained multicommodity minimum cost flow problem (CMCF) to optimality.…
Traffic management and route guidance are optimization problems by nature. In this article, we consider algorithms for centralized route guidance and discuss fairness aspects for the individual user resulting from optimal route guidance policies. The first part of this article deals with the mathematical aspects of these optimization problems from the viewpoint of network flow theory.We present algorithms which solve the constrained multicommodity minimum cost flow problem (CMCF) to optimality. A feasible routing is given by a flow x, and the cost of flow x is the total travel time spent in the network. The corresponding optimum is a restricted system optimum with a globally controlled constrained or fairness factor L > 1. This approach implements a compromise between user equilibrium and system optimum. The goal is to find a route guidance strategy which minimizes global and community criteria with individual needs as constraints. The fairness factor L restricts the set of all feasible routes to the subset of acceptable routes. This might include the avoidance of routes which are much longer than shortest routes, the exclusion of certain streets, preferences for scenic paths, or restrictions on the number of turns to be taken. Most remarkably is that the subset of acceptable routes can also be interpreted as a mental map of routes.
In the second part we apply our CMCF algorithms in a large scale multi-agent transportation simulation toolkit, which is called MATSIM-T. We use as initial routes the ones computed by our CMCF algorithms. This choice of initial routes makes it possible to exploit the optimization potential within the simulation much better then it was done before. The result is a speed up of the iteration process in the simulation. We compare the existing simulation toolkit with the new integration of CMCF to proof our results.Andere Autor:innenVeröffentlichung anzeigen -
Length-Bounded Cuts and Flows
ICALP 2006: Automata, Languages and Programming - 33rd International Colloquium, Part I, LNCS 4051, pp. 679–690
An L-length-bounded cut in a graph G with source s, and sink t is a cut that destroys all s-t-paths of length at most L. An L-length-bounded flow is a flow in which only flow paths of length at most L are used. We show that the minimum length-bounded cut problem in graphs with unit edge lengths is NP-hard to approximate within a factor of at least 1.1377 for L ≧ 5 in the case of node-cuts and for L ≧ 4 in the case of edge-cuts. We also give approximation algorithms of ratio min{L, n/L} in the…
An L-length-bounded cut in a graph G with source s, and sink t is a cut that destroys all s-t-paths of length at most L. An L-length-bounded flow is a flow in which only flow paths of length at most L are used. We show that the minimum length-bounded cut problem in graphs with unit edge lengths is NP-hard to approximate within a factor of at least 1.1377 for L ≧ 5 in the case of node-cuts and for L ≧ 4 in the case of edge-cuts. We also give approximation algorithms of ratio min{L, n/L} in the node case and min{L, n2/L2,√m} in the edge case, where n denotes the number of nodes and m denotes the number of edges. We discuss the integrality gaps of the LP relaxations of length-bounded flow and cut problems, analyze the structure of optimal solutions, and present further complexity results for special cases.
Andere Autor:innenVeröffentlichung anzeigen -
Computing Sea Routes for Ships
HPSC 2006: International Conference on High Performance Scientific Computing
We discuss the problem of computing routes for ships. Depending on the weather situation and the sea state we try to find a route that minimizes the fuel consumption of a ship. Additionally, parameters such as the rolling angle of a ship have to be kept below a given bound on the route to be computed.
We distinguish two scenarios: the common routing and the disaster scenario. In the first case, there is a fixed point in time up to which the destination has to be reached. In the case of a…We discuss the problem of computing routes for ships. Depending on the weather situation and the sea state we try to find a route that minimizes the fuel consumption of a ship. Additionally, parameters such as the rolling angle of a ship have to be kept below a given bound on the route to be computed.
We distinguish two scenarios: the common routing and the disaster scenario. In the first case, there is a fixed point in time up to which the destination has to be reached. In the case of a ship disaster, we have to solve the problem of reaching the nearest refuge in the shortest possible time and coping with limited manoeuvring capabilities.
To solve the problem, we suggest a discretized network which models turning possibilities of ships on the sea. In this network, nodes are associated with costs. The costs vary with the turning angle and the following three parameters: wave height, wave period, wave direction. These parameters are time-dependent and can be derived from the weather forecast. Obviously, the forecast is less reliable when the point in time to which it refers is further away in the future.
We present routing algorithms for this dynamic network setting. The algorithms will be part of a weather and sea routing advice decision support system for ships.Andere Autor:innenVeröffentlichung anzeigen -
Partitioning Graphs to Speedup Dijkstra’s Algorithm
ACM Journal of Experimental Algorithmics, Vol. 11, Article No. 2.8, pp. 1–29
We study an acceleration method for point-to-point shortest-path computations in large and sparse directed graphs with given nonnegative arc weights. The acceleration method is called the arc-flag approach and is based on Dijkstra’s algorithm. In the arc-flag approach, we allow a preprocessing of the network data to generate additional information, which is then used to speedup shortest-path queries. In the preprocessing phase, the graph is divided into regions and information is gathered on…
We study an acceleration method for point-to-point shortest-path computations in large and sparse directed graphs with given nonnegative arc weights. The acceleration method is called the arc-flag approach and is based on Dijkstra’s algorithm. In the arc-flag approach, we allow a preprocessing of the network data to generate additional information, which is then used to speedup shortest-path queries. In the preprocessing phase, the graph is divided into regions and information is gathered on whether an arc is on a shortest path into a given region. The arc-flag method combined with an appropriate partitioning and a bidirected search achieves an average speedup factor of more than 500 compared to the standard algorithm of Dijkstra on large networks (1 million nodes, 2.5 million arcs). This combination narrows down the search space of Dijkstra’s algorithm to almost the size of the corresponding shortest path for long-distance shortest-path queries. We conduct an experimental study that evaluates which partitionings are best suited for the arc-flag method. In particular, we examine partitioning algorithms from computational geometry and a multiway arc separator partitioning. The evaluation was done on German road networks. The impact of different partitions on the speedup of the shortest path algorithm are compared. Furthermore, we present an extension of the speedup technique to multiple levels of partitions. With this multilevel variant, the same speedup factors can be achieved with smaller space requirements. It can, therefore, be seen as a compression of the precomputed data that preserves the correctness of the computed shortest paths.
Andere Autor:innenVeröffentlichung anzeigen -
Acceleration of Shortest Path and Constrained Shortest Path Computation
WEA 2005: 4th International Workshop on Efficient and Experimental Algorithms, LNCS 3503, pp. 126–138
We study acceleration methods for point-to-point shortest path and constrained shortest path computations in directed graphs, in particular in road and railroad networks. Our acceleration methods are allowed to use a preprocessing of the network data to create auxiliary information which is then used to speed-up shortest path queries. We focus on two methods based on Dijkstra’s algorithm for shortest path computations and two methods based on a generalized version of Dijkstra for constrained…
We study acceleration methods for point-to-point shortest path and constrained shortest path computations in directed graphs, in particular in road and railroad networks. Our acceleration methods are allowed to use a preprocessing of the network data to create auxiliary information which is then used to speed-up shortest path queries. We focus on two methods based on Dijkstra’s algorithm for shortest path computations and two methods based on a generalized version of Dijkstra for constrained shortest paths. The methods are compared with other acceleration techniques, most of them published only recently.We also look at appropriate combinations of different methods to find further improvements. For shortest path computations we investigate hierarchical multiway-separator and arc-flag approaches. The hierarchical multiway-separator approach divides the graph into regions along a multiway-separator and gathers information to improve the search for shortest paths that stretch over several regions. A new multiway-separator heuristic is presented which improves the hierarchical separator approach. The arc-flag approach divides the graph into regions and gathers information on whether an arc is on a shortest path into a given region. Both methods yield significant speed-ups of the plain Dijkstra’s algorithm. The arc flag method combined with an appropriate partition and a bi-directed search achieves an average speed-up of up to 1,400 on large networks. This combination narrows down the search space of Dijkstra’s algorithm to almost the size of the corresponding shortest path for long distance shortest path queries. For the constrained shortest path problem we show that goal-directed and bi-directed acceleration methods can be used both individually and in combination. The goal-directed search achieves the best speed-up factor of 110 for the constrained problem.
Andere Autor:innen -
-
Partitioning Graphs to Speed Up Dijkstra’s Algorithm
WEA 2005: 4th International Workshop on Efficient and Experimental Algorithms, LNCS 3503, pp. 189–202
In this paper, we consider Dijkstra’s algorithm for the point-to-point shortest path problem in large and sparse graphs with a given layout. In [1], a method has been presented that uses a partitioning of the graph to perform a preprocessing which allows to speed-up Dijkstra’s algorithm considerably.
We present an experimental study that evaluates which partitioning methods are suited for this approach. In particular, we examine partitioning algorithms from computational geometry and compare…In this paper, we consider Dijkstra’s algorithm for the point-to-point shortest path problem in large and sparse graphs with a given layout. In [1], a method has been presented that uses a partitioning of the graph to perform a preprocessing which allows to speed-up Dijkstra’s algorithm considerably.
We present an experimental study that evaluates which partitioning methods are suited for this approach. In particular, we examine partitioning algorithms from computational geometry and compare their impact on the speed-up of the shortest-path algorithm. Using a suited partitioning algorithm speed-up factors of 500 and more were achieved.
Furthermore, we present an extension of this speed-up technique to multiple levels of partitionings. With this multi-level variant, the same speed-up factors can be achieved with smaller space requirements. It can therefore be seen as a compression of the precomputed data that conserves the correctness of the computed shortest paths.Andere Autor:innenVeröffentlichung anzeigen -
Flows over Time: Towards a more Realistic and Computationally Tractable Model
ALENEX 2005: 7th Workshop on Algorithm Engineering and Experiments
We introduce a novel model for "Fows over time" which captures the behavior of cars traveling through a road network better than previous models. We show that computing an optimal solution in the new model is NP-hard and present an LP-based algorithm which we evaluate with several experiments on real world data of road networks and generated requests. Among other things we compare the quality of the solutions with solutions generated by an FPTAS for a related but considerably less realistic…
We introduce a novel model for "Fows over time" which captures the behavior of cars traveling through a road network better than previous models. We show that computing an optimal solution in the new model is NP-hard and present an LP-based algorithm which we evaluate with several experiments on real world data of road networks and generated requests. Among other things we compare the quality of the solutions with solutions generated by an FPTAS for a related but considerably less realistic model.
Andere Autor:innenVeröffentlichung anzeigen -
Downwind numbering for pre-condition convection dominated problems
Diploma Thesis, E522, University of Goettingen
Patente
-
Methods and systems for obtaining a multi-modal route
Ausgestellt am US US 20160202079 A1
A method of performing routing in relation to a multi-modal transportation network involves representing a multi-modal transportation network using a plurality of segments, each being indicative of a navigable segment of the network, and each segment having data representative of a traversal time for the segment associated therewith. The plurality of segments of the multi-modal transportation network includes a first subset of segments indicative of a public transport network, and a second…
A method of performing routing in relation to a multi-modal transportation network involves representing a multi-modal transportation network using a plurality of segments, each being indicative of a navigable segment of the network, and each segment having data representative of a traversal time for the segment associated therewith. The plurality of segments of the multi-modal transportation network includes a first subset of segments indicative of a public transport network, and a second subset of segments indicative of a road network which may be joined, left and travelled through by a user substantially freely at any time. The traversal time data associated with origin segments of the public transport network associated with interchange points with the road network is based on a transit time indicative of a time taken to both train and road networks travel along the segment, and an additional waiting time. A route search is performed between an origin and a destination within the multi-modal transportation network using the traversal time data associated with the segments of the network in order to obtain one or more multi-modal route through the transportation network.
Andere Erfinder:innenPatent anzeigen -
METHOD FOR COMPRESSING ROUTE SEARCH ACCELERATION DATA
Ausgestellt am EU EP 2565582 A1
A method of creating map data, including search acceleration data arranged to increase the speed at which a route can be planned across an electronic map, which comprises a plurality of navigable segments, representing segments of a navigable route in the area covered by the map, wherein the method comprises: a) processing the navigable segments in order to generate the search acceleration data for at least some of, and generally each of, the navigable segments of the electronic map indicating…
A method of creating map data, including search acceleration data arranged to increase the speed at which a route can be planned across an electronic map, which comprises a plurality of navigable segments, representing segments of a navigable route in the area covered by the map, wherein the method comprises: a) processing the navigable segments in order to generate the search acceleration data for at least some of, and generally each of, the navigable segments of the electronic map indicating whether that navigable segment is part of a minimum cost route; and b) processing the generated search acceleration data in order to compress that data wherein the compression includes computing the correlation of pairs of bits in the search acceleration data and coalescing correlated bits.
Andere Erfinder:innenPatent anzeigen -
System and method of generating a route across an electronic map
Ausgestellt am US US 20130046465 A1
A computerised method of generating a route 1000 from an origin position F1 to a destination position 706 across an electronic map 700 comprising a plurality of vectors representing segments of a navigable route in the area covered by the electronic map 700, the method comprising: (1) obtaining delay data indicating delays on vectors within the area covered by the electronic map 700; (2) calculating a first portion 1002 of a route from origin position toward the destination position 706 using a…
A computerised method of generating a route 1000 from an origin position F1 to a destination position 706 across an electronic map 700 comprising a plurality of vectors representing segments of a navigable route in the area covered by the electronic map 700, the method comprising: (1) obtaining delay data indicating delays on vectors within the area covered by the electronic map 700; (2) calculating a first portion 1002 of a route from origin position toward the destination position 706 using a first routing method up to a predetermined threshold 1006 from the origin position F1, such that the first routing method uses the delay data so that the first portion 1002 of the route takes into account delays; and (3) calculating a second portion 1004 of the route beyond the predetermined threshold 1006 to the destination position 706 using a second routing method to further calculate the route to the destination position 1006.
Andere Erfinder:innenPatent anzeigen -
Navigation devices
Ausgestellt am US US20130173152 A1
A method of creating map data including search acceleration data arranged to increase the speed at which a route can be planned across an electronic map comprising a plurality of navigable segments, each navigable segment representing a segment of a navigable route in the area covered by the map.
Andere Erfinder:innenPatent anzeigen -
SYSTEM AND METHOD OF GENERATING A ROUTE ACROSS AN ELECTRONIC MAP
Ausgestellt am EU WO/2011/131417
A computerised method of generating a route (1000) from an origin position F1 to a destination position (706) across an electronic map (700) comprising a plurality of vectors representing segments of a navigable route in the area covered by the electronic map (700), the method comprising: (1) obtaining delay data indicating delays on vectors within the area covered by the electronic map (700); (2) calculating a first portion (1002) of a route from origin position toward the destination position…
A computerised method of generating a route (1000) from an origin position F1 to a destination position (706) across an electronic map (700) comprising a plurality of vectors representing segments of a navigable route in the area covered by the electronic map (700), the method comprising: (1) obtaining delay data indicating delays on vectors within the area covered by the electronic map (700); (2) calculating a first portion (1002) of a route from origin position toward the destination position (706) using a first routing method up to a predetermined threshold (1006) from the origin position F1, such that the first routing method uses the delay data so that the first portion (1002) of the route takes into account delays; and (3) calculating a second portion (1004) of the route beyond the predetermined threshold (1006) to the destination position (706) using a second routing method to further calculate the route to the destination position (1006).
Andere Erfinder:innenPatent anzeigen -
NAVIGATION DEVICE USING MAP DATA WITH ROUTE SEARCH ACCELERATION DATA
Ausgestellt am EU WO/2011/004029
A method of creating map data including search acceleration data arranged to increase the speed at which a route can be planned across an electronic map comprising a plurality of navigable segments, each navigable segment representing a segment of a navigable route in the area covered by the map, wherein the method comprises: a) reducing the number of navigable segments to be considered in the creation of the search acceleration data by removing navigable segments to form a core network of…
A method of creating map data including search acceleration data arranged to increase the speed at which a route can be planned across an electronic map comprising a plurality of navigable segments, each navigable segment representing a segment of a navigable route in the area covered by the map, wherein the method comprises: a) reducing the number of navigable segments to be considered in the creation of the search acceleration data by removing navigable segments to form a core network of navigable segments; b) dividing the electronic map into a set of hierarchical regions such that the or each navigable segment is categorized into at least one region in each level of the hierarchy; c) using a time varying function associated with at least some, and generally each, navigable segment of the core network to determine whether that navigable segment is part of minimum cost route to at least one of the regions and recording this determination in the search acceleration data.
Andere Erfinder:innenPatent anzeigen -
NAVIGATION DEVICES AND METHODS CARRIED OUT THEREON
Ausgestellt am EU WO/2011/131376
This invention concerns a method of determining a route using map data comprising a plurality of navigable paths, the map data divided into a plurality of regions. The method comprises using at least one processing apparatus to: receive an origin and a destination on the map data and a selection of one of a plurality of cost functions and determine a route from the origin to the destination using the map data and minimum cost data that identifies minimum cost paths between regions of the map…
This invention concerns a method of determining a route using map data comprising a plurality of navigable paths, the map data divided into a plurality of regions. The method comprises using at least one processing apparatus to: receive an origin and a destination on the map data and a selection of one of a plurality of cost functions and determine a route from the origin to the destination using the map data and minimum cost data that identifies minimum cost paths between regions of the map data. The minimum cost data identifies more than one minimum cost path between a pair of the regions if different minimum cost paths exist between the pair of regions for different cost functions and determining a route comprises identifying from the minimum cost paths for the pair of regions comprising the origin and destination, the minimum cost path having a lowest cost for the selected cost function.
Andere Erfinder:innenPatent anzeigen -
NAVIGATION DEVICE AND METHOD FOR TIME - DEPENDENT ROUTE CALCULATION
Ausgestellt am EU WO/2011/004026
This invention concerns a method of determining a route using map data comprising a plurality of navigable paths, the map data divided into a plurality of regions. The method comprises using at least one processing apparatus to: receive an origin and a destination on the map data and a travel time, determine a route from the origin to the destination using the map data and minimum cost data that identifies minimum cost paths between regions of the map data. The minimum cost data identifies more…
This invention concerns a method of determining a route using map data comprising a plurality of navigable paths, the map data divided into a plurality of regions. The method comprises using at least one processing apparatus to: receive an origin and a destination on the map data and a travel time, determine a route from the origin to the destination using the map data and minimum cost data that identifies minimum cost paths between regions of the map data. The minimum cost data identifies more than one minimum cost path between a pair of the regions if different minimum cost paths exist between the pair of regions at different times and determining a route comprises identifying from the minimum cost paths for the pair of regions comprising the origin and destination, the minimum cost path having a lowest cost at the travel time.
Andere Erfinder:innenPatent anzeigen -
Navigation devices and methods carried out thereon
Ausgestellt am US US 20130204527 A1
This invention concerns a method of determining a route using map data comprising a plurality of navigable paths, the map data divided into a plurality of regions. The method comprises using at least one processing apparatus to: receive an origin and a destination on the map data and a selection of one of a plurality of cost functions and determine a route from the origin to the destination using the map data and minimum cost data that identifies minimum cost paths between regions of the map…
This invention concerns a method of determining a route using map data comprising a plurality of navigable paths, the map data divided into a plurality of regions. The method comprises using at least one processing apparatus to: receive an origin and a destination on the map data and a selection of one of a plurality of cost functions and determine a route from the origin to the destination using the map data and minimum cost data that identifies minimum cost paths between regions of the map data. The minimum cost data identifies more than one minimum cost path between a pair of the regions if different minimum cost paths exist between the pair of regions for different cost functions and determining a route comprises identifying from the minimum cost paths for the pair of regions comprising the origin and destination, the minimum cost path having a lowest cost for the selected cost function.
Andere Erfinder:innenPatent anzeigen -
Navigation devices and methods carried out thereon
Ausgestellt am US US 20120158301 A1
This invention concerns a method of determining a route using map data comprising a plurality of navigable paths, the map data divided into a plurality of regions. The method comprises using at least one processing apparatus to: receive an origin and a destination on the map data and a travel time, determine a route from the origin to the destination using the map data and minimum cost data that identifies minimum cost paths between regions of the map data. The minimum cost data identifies more…
This invention concerns a method of determining a route using map data comprising a plurality of navigable paths, the map data divided into a plurality of regions. The method comprises using at least one processing apparatus to: receive an origin and a destination on the map data and a travel time, determine a route from the origin to the destination using the map data and minimum cost data that identifies minimum cost paths between regions of the map data. The minimum cost data identifies more than one minimum cost path between a pair of the regions if different minimum cost paths exist between the pair of regions at different times and determining a route comprises identifying from the minimum cost paths for the pair of regions comprising the origin and destination, the minimum cost path having a lowest cost at the travel time.
Andere Erfinder:innenPatent anzeigen
Projekte
-
eCOMPASS: ECO-friendly urban multi-modal route planning services for mobile users
-
- 2.6m euros EC subsidies, 6 consortium partners: ETHZ, KTI, CTI, CERTH, PTV & TomTom
- New approaches to daily usage of navigation and mapping technologies, 49 publicationsAndere Mitarbeiter:innenProjekt anzeigen -
Adaptive Traffic Control with ptv AG
-
- Optimised route assignment in large scale multi-agent transport micro-simulation MATSim.org
- Cut 50+% of comp. time, cut 10+% of travel time, methods were validated in VISUMAndere Mitarbeiter:innen -
-
Decision support system for ships with Carnival, P&O Cruises, Teekay and Siemens
-
- Solved weather-dependent routing problems for cargo and passenger ships
- Reduced comp. times from days to few minutes, our algorithms were tested on 2 ships in 2007Andere Mitarbeiter:innenProjekt anzeigen -
Optimizing the Cargo Express Service of Swiss Federal Railways
-
Developed optimal routing and shunting solution for 60 railway engines and several thousands
of wagon shipments which cut 30% of operating costs ? 3m euros p.a.Andere Mitarbeiter:innenProjekt anzeigen -
Efficient Algorithms for Traffic Flow Problems in Large Networks with Mercedes-Benz
-
Developed computationally tractable models and algorithms for centralised route assignment
and evaluated them on European and American traffic network data
Solved a number of theoretical problems and published them at conferences and in journals:
http://www3.math.tu-berlin.de/coga/people/schillin/publications.xhtmlAndere Mitarbeiter:innen -
Auszeichnungen/Preise
-
Fellow
TomTom
- Became one of the first of 7 Fellows at TomTom (5,000 employees)
- 'Fellow' is the highest level in TomTom's technical career ladder, appointed by the board based on individual achievement
“The TomTom Fellow is the highest level in the new technical ladder, equivalent to the VP grade in our grading system. It was created to ensure that the best of the best in Engineering would be called out and so that they could remain close to technology [...]. We expect the Fellow grade to be…- Became one of the first of 7 Fellows at TomTom (5,000 employees)
- 'Fellow' is the highest level in TomTom's technical career ladder, appointed by the board based on individual achievement
“The TomTom Fellow is the highest level in the new technical ladder, equivalent to the VP grade in our grading system. It was created to ensure that the best of the best in Engineering would be called out and so that they could remain close to technology [...]. We expect the Fellow grade to be awarded only to a few and unlike other grades in our new system it is not a reflection of someones role, but is purely based on the person.” Jorgen Behrens, EVP -
Nominated for the Dissertation Award
American Transportation Science
https://www.informs.org/Find-Research-Publications/Journals/Transportation-Science
-
Nominated for the Dissertation Award
German Operations Research Society
https://gor.uni-paderborn.de
-
Full scholarship from 1996-2000
Cusanuswerk
awarded to less than 1% of German students
http://www.cusanuswerk.de -
1/2/3rd places in 1983-1992 at the German Olympiad of Mathematicians
International Mathematical Olympiad (IMO)
from 1983-1992 I regularly participated in the German Olympiad of Mathematicians, that's the qualification round of International Mathematical Olympiad (IMO)
http://imo-official.org/
Sprachen
-
Englisch
Verhandlungssicher
-
German
Muttersprache oder zweisprachig
Organisationen
-
Open AutoDrive Forum (openautodrive.org)
Member
–Heute- Act as open discussion platform for cross-domain topics in the area of autonomous driving that require cooperation throughout the industry. - Generate globally applicable, state-of-the-art solution possibilities as further input for standardization in organized bodies. - Connect local authorities and the global industry to streamline future development efforts. - Act as a platform to present the latest developments and achievements towards a connected world of autonomous…
- Act as open discussion platform for cross-domain topics in the area of autonomous driving that require cooperation throughout the industry. - Generate globally applicable, state-of-the-art solution possibilities as further input for standardization in organized bodies. - Connect local authorities and the global industry to streamline future development efforts. - Act as a platform to present the latest developments and achievements towards a connected world of autonomous cars. http://www.openautodrive.org/
-
NDS Association (nds-association.org)
Board Member
–HeuteNavigation Data Standard (NDS) is a registered association with the vision of providing a leading world-wide map standard for automotive grade use. The NDS Association consists of car manufacturers, application/compiler developers, map and service providers.
-
10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS)
Program Committee member
-"Since 2000, the series of ATMOS workshops brings together researchers and practitioners who are interested in all aspects of algorithmic methods and models for transportation optimization and provides a forum for the exchange and dissemination of new ideas and techniques. Transportation networks give rise to very complex and large-scale network optimization problems requiring innovative solution techniques and ideas from mathematical optimization, theoretical computer science, and operations…
"Since 2000, the series of ATMOS workshops brings together researchers and practitioners who are interested in all aspects of algorithmic methods and models for transportation optimization and provides a forum for the exchange and dissemination of new ideas and techniques. Transportation networks give rise to very complex and large-scale network optimization problems requiring innovative solution techniques and ideas from mathematical optimization, theoretical computer science, and operations research. Applicable tools and concepts include those from graph and network algorithms, combinatorial optimization, approximation and online algorithms, stochastic and robust optimization. The scope of the workshop comprises all modes of transportation." http://algo2010.csc.liv.ac.uk/atmos/
-
DFG Research Center MATHEON—Mathematics for key technologies (matheon.de)
Associated member
-"DFG Research Center Matheon develops mathematics for key technologies and supports partners in industry, economy and science. We also cooperate with schools and the general public. Founded in 2002, Matheon is a joint initiative of the three Berlin universities (FU, HU and TU) and the mathematical research centers (WIAS and ZIB)."
-
European Graduate Program ”Combinatorics, Geometry, and Computation”
Member
-"The European Graduate Program is a joint initiative of the ETH Zürich, the three universities of Berlin - Freie Universität, Technische Universität und Humboldt-Universität and the Konrad-Zuse-Research Center Berlin (and a number of other partner European institutions). Among others, the goal is to establish international contacts both on the research and educational side, and to create a focused program with completion of a Ph.D. thesis within three…
"The European Graduate Program is a joint initiative of the ETH Zürich, the three universities of Berlin - Freie Universität, Technische Universität und Humboldt-Universität and the Konrad-Zuse-Research Center Berlin (and a number of other partner European institutions). Among others, the goal is to establish international contacts both on the research and educational side, and to create a focused program with completion of a Ph.D. thesis within three years." http://w3.inf.fu-berlin.de/graduate-programs/cgc/
Erhaltene Empfehlungen
16 Personen haben Heiko Schilling empfohlen
Jetzt anmelden und ansehenWeitere Aktivitäten von Heiko Schilling
-
Nur mal so, auch wenn Untergangsszenarien beliebter sind: Innerhalb der Messtoleranzen entwickelt sich die Wirtschaft in den jeweils vergleichbaren…
Nur mal so, auch wenn Untergangsszenarien beliebter sind: Innerhalb der Messtoleranzen entwickelt sich die Wirtschaft in den jeweils vergleichbaren…
Beliebt bei Heiko Schilling
-
Friedrich Merz: "Der Schutz der Bevölkerung ist die wichtigste Aufgabe der Politik. Das muss jetzt absolute Priorität haben." Gilt das eigentlich…
Friedrich Merz: "Der Schutz der Bevölkerung ist die wichtigste Aufgabe der Politik. Das muss jetzt absolute Priorität haben." Gilt das eigentlich…
Beliebt bei Heiko Schilling
-
Sollte man wissen: Maßnahmen zu Verhinderung von Schäden, zur Aufrechterhaltung von Infrastruktur, dem Leben - ist deutlich günstiger, als die…
Sollte man wissen: Maßnahmen zu Verhinderung von Schäden, zur Aufrechterhaltung von Infrastruktur, dem Leben - ist deutlich günstiger, als die…
Beliebt bei Heiko Schilling
-
Offener Brief eines Autohändlers an die deutschen Autohersteller .. Wir leben in einer Zeit großer Verunsicherung in der Autobranche, in der…
Offener Brief eines Autohändlers an die deutschen Autohersteller .. Wir leben in einer Zeit großer Verunsicherung in der Autobranche, in der…
Beliebt bei Heiko Schilling
-
Norwegen setzt weiterhin Maßstäbe in der #Elektromobilität, was sich in der beeindruckenden Zulassungsrate von 97 % für rein elektrische #Fahrzeuge…
Norwegen setzt weiterhin Maßstäbe in der #Elektromobilität, was sich in der beeindruckenden Zulassungsrate von 97 % für rein elektrische #Fahrzeuge…
Beliebt bei Heiko Schilling
Weitere ähnliche Profile
Weitere Mitglieder namens Heiko Schilling in Deutschland
-
Heiko Schilling
Senior Manager at Daimler AG
-
Heiko Schilling
-
Heiko Schilling
Automotive Engineer
-
Heiko Schilling
Senior architect for sustainable buildings Founder of ‚Schilling Architektur‘. Pursuing LEED AP certification.
Es gibt auf LinkedIn 13 weitere Personen namens Heiko Schilling, die sich in Deutschland befinden.
Weitere Mitglieder anzeigen, die Heiko Schilling heißen