Scalable Many-Objective Pathfinding Benchmark Suite
- URL: http://arxiv.org/abs/2010.04501v1
- Date: Fri, 9 Oct 2020 11:17:49 GMT
- Title: Scalable Many-Objective Pathfinding Benchmark Suite
- Authors: Jens Weise, Sanaz Mostaghim
- Abstract summary: We propose a scalable many-objective benchmark problem covering most of the important features for routing applications based on real-world data.
We define five objective functions representing distance, traveling time, delays caused by accidents, and two route specific features such as curvature and elevation.
Since this test benchmark can be easily transferred to real-world routing problems, we construct a routing problem from OpenStreetMap data.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: Route planning also known as pathfinding is one of the key elements in
logistics, mobile robotics and other applications, where engineers face many
conflicting objectives. However, most of the current route planning algorithms
consider only up to three objectives. In this paper, we propose a scalable
many-objective benchmark problem covering most of the important features for
routing applications based on real-world data. We define five objective
functions representing distance, traveling time, delays caused by accidents,
and two route specific features such as curvature and elevation. We analyse
several different instances for this test problem and provide their true
Pareto-front to analyse the problem difficulties. We apply three well-known
evolutionary multi-objective algorithms. Since this test benchmark can be
easily transferred to real-world routing problems, we construct a routing
problem from OpenStreetMap data. We evaluate the three optimisation algorithms
and observe that we are able to provide promising results for such a real-world
application. The proposed benchmark represents a scalable many-objective route
planning optimisation problem enabling researchers and engineers to evaluate
their many-objective approaches.
Related papers
- PathwayBench: Assessing Routability of Pedestrian Pathway Networks Inferred from Multi-City Imagery [15.563635571840733]
Application to support pedestrian mobility in urban areas requires a complete, and routable graph representation of the built environment.
Relative to road network pathways, pedestrian network pathways are narrower, more frequently disconnected, often visually and materially variable in smaller areas.
Existing algorithms to extract pedestrian pathway network graphs are inconsistently evaluated and tend to ignore routability.
arXiv Detail & Related papers (2024-07-23T22:47:32Z) - DeTra: A Unified Model for Object Detection and Trajectory Forecasting [68.85128937305697]
Our approach formulates the union of the two tasks as a trajectory refinement problem.
To tackle this unified task, we design a refinement transformer that infers the presence, pose, and multi-modal future behaviors of objects.
In our experiments, we observe that ourmodel outperforms the state-of-the-art on Argoverse 2 Sensor and Open dataset.
arXiv Detail & Related papers (2024-06-06T18:12:04Z) - A Bi-Objective Approach to Last-Mile Delivery Routing Considering Driver Preferences [42.16665455951525]
The Multi-Objective Vehicle Routing Problem (MOVRP) is a complex optimization problem in the transportation and logistics industry.
This paper proposes a novel approach to the MOVRP that aims to create routes that consider drivers' and operators' decisions and preferences.
We evaluate two approaches to address this objective: visually attractive route planning and data mining of historical driver behavior to plan similar routes.
arXiv Detail & Related papers (2024-05-25T04:25:00Z) - Probable Object Location (POLo) Score Estimation for Efficient Object
Goal Navigation [15.623723522165731]
We introduce a novel framework centered around the Probable Object Location (POLo) score.
We further enhance the framework's practicality by introducing POLoNet, a neural network trained to approximate the computationally intensive POLo score.
Our experiments, involving the first phase of the OVMM 2023 challenge, demonstrate that an agent equipped with POLoNet significantly outperforms a range of baseline methods.
arXiv Detail & Related papers (2023-11-14T08:45:32Z) - POA: Passable Obstacles Aware Path-planning Algorithm for Navigation of
a Two-wheeled Robot in Highly Cluttered Environments [53.41594627336511]
Passable Obstacles Aware (POA) planner is a novel navigation method for two-wheeled robots in a cluttered environment.
Our algorithm allows two-wheeled robots to find a path through passable obstacles.
arXiv Detail & Related papers (2023-07-16T19:44:27Z) - Preference-Aware Delivery Planning for Last-Mile Logistics [3.04585143845864]
We propose a novel hierarchical route with learnable parameters that combines the strength of both the optimization and machine learning approaches.
By using a real-world delivery dataset provided by the Amazon Last Mile Research Challenge, we demonstrate the importance of having both the optimization and the machine learning components.
arXiv Detail & Related papers (2023-03-08T02:10:59Z) - Find a Way Forward: a Language-Guided Semantic Map Navigator [53.69229615952205]
This paper attacks the problem of language-guided navigation in a new perspective.
We use novel semantic navigation maps, which enables robots to carry out natural language instructions and move to a target position based on the map observations.
The proposed approach has noticeable performance gains, especially in long-distance navigation cases.
arXiv Detail & Related papers (2022-03-07T07:40:33Z) - Ranking Cost: Building An Efficient and Scalable Circuit Routing Planner
with Evolution-Based Optimization [49.207538634692916]
We propose a new algorithm for circuit routing, named Ranking Cost, to form an efficient and trainable router.
In our method, we introduce a new set of variables called cost maps, which can help the A* router to find out proper paths.
Our algorithm is trained in an end-to-end manner and does not use any artificial data or human demonstration.
arXiv Detail & Related papers (2021-10-08T07:22:45Z) - Multi-Objective Path-Based D* Lite [10.354181009277623]
Incremental graph search algorithms, such as D* Lite, reuse previous search efforts to speed up subsequent similar path planning tasks.
This article presents a new multi-objective incremental search algorithm called Multi-Objective Path-Based D* Lite (MOPBD*)
Numerical results show that MOPBD* is more efficient than search from scratch and runs an order of magnitude faster than existing incremental method for path planning.
arXiv Detail & Related papers (2021-08-02T08:24:32Z) - Neural Architecture Search From Fr\'echet Task Distance [50.9995960884133]
We show how the distance between a target task and each task in a given set of baseline tasks can be used to reduce the neural architecture search space for the target task.
The complexity reduction in search space for task-specific architectures is achieved by building on the optimized architectures for similar tasks instead of doing a full search without using this side information.
arXiv Detail & Related papers (2021-03-23T20:43:31Z) - MRDet: A Multi-Head Network for Accurate Oriented Object Detection in
Aerial Images [51.227489316673484]
We propose an arbitrary-oriented region proposal network (AO-RPN) to generate oriented proposals transformed from horizontal anchors.
To obtain accurate bounding boxes, we decouple the detection task into multiple subtasks and propose a multi-head network.
Each head is specially designed to learn the features optimal for the corresponding task, which allows our network to detect objects accurately.
arXiv Detail & Related papers (2020-12-24T06:36:48Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.