English
Related papers

Related papers: Timeliness-aware On-site Planning Method for Tour …

200 papers

In this paper we present an algorithm for optimal processing of time-dependent sequenced route queries in road networks, i.e., given a road network where the travel time over an edge is time-dependent and a given ordered list of categories…

The Traveling Thief Problem (TTP) is a multi-component optimization problem that captures the interplay between routing and packing decisions by combining the classical Traveling Salesperson Problem (TSP) and the Knapsack Problem (KP). The…

Data Structures and Algorithms · Computer Science 2026-04-22 Jan Eube , Kelin Luo , Aneta Neumann , Frank Neumann , Heiko Röglin

We propose an active 3D mapping method for depth sensors, which allow individual control of depth-measuring rays, such as the newly emerging solid-state lidars. The method simultaneously (i) learns to reconstruct a dense 3D occupancy map…

Computer Vision and Pattern Recognition · Computer Science 2017-08-08 Karel Zimmermann , Tomas Petricek , Vojtech Salansky , Tomas Svoboda

Robotic pick-and-place (PnP) operations on moving conveyors find a wide range of industrial applications. In practice, simple greedy heuristics (e.g., prioritization based on the time to process a single object) are applied that achieve…

Robotics · Computer Science 2019-12-18 Shuai D. Han , Si Wei Feng , Jingjin Yu

Recently, with the advancement of the GPS-enabled cellular technologies, the location-based services (LBS) have gained in popularity. Nowadays, an increasingly larger number of map-based applications enable users to ask a wider variety of…

Data Structures and Algorithms · Computer Science 2017-06-27 Radi Muhammad Reza , Mohammed Eunus Ali , Muhammad Aamir Cheema

Motivated by the use of high speed circuit switches in large scale data centers, we consider the problem of circuit switch scheduling. In this problem we are given demands between pairs of servers and the goal is to schedule at every time…

Data Structures and Algorithms · Computer Science 2019-05-09 Roy Schwartz , Mohit Singh , Sina Yazdanbod

In this paper we prove the efficacy of a simple greedy algorithm for a finite horizon online resource allocation/matching problem, when the corresponding static planning linear program (SPP) exhibits a non-degeneracy condition called the…

Data Structures and Algorithms · Computer Science 2022-07-26 Varun Gupta

Facility location problems aim to identify the best locations to set up new services. Majority of the existing works typically assume that the users are static. However, there exists a wide array of services such as fuel stations, ATMs,…

Databases · Computer Science 2019-08-05 Shubhadip Mitra , Priya Saraf , Arnab Bhattacharya

Finding the next venue to be visited by a user in a specific city is an interesting, but challenging, problem. Different techniques have been proposed, combining collaborative, content, social, and geographical signals; however it is not…

Information Retrieval · Computer Science 2018-09-27 Pablo Sánchez , Alejandro Bellogín

In this paper, we investigate the problem of designing the mobile elements tours such that the length of each tour is below a per-determined length and the depth of the multi-hop routing trees bounded by k. The path of the mobile element is…

Networking and Internet Architecture · Computer Science 2014-04-02 Bassam A. alqaralleh , Khaled Almiani

With the goal of efficiently computing collision-free robot motion trajectories in dynamically changing environments, we present results of a novel method for Heuristics Informed Robot Online Path Planning (HIRO). Dividing robot…

Robotics · Computer Science 2024-10-29 Xi Huang , Gergely Sóti , Hongyi Zhou , Christoph Ledermann , Björn Hein , Torsten Kröger

Realistic path planning applications often require optimizing with respect to several criteria simultaneously. Here we introduce an efficient algorithm for bi-criteria path planning on graphs. Our approach is based on augmenting the state…

When users search for the routes between two places using map based services, these services compute and provide the top candidate routes based on shortest geometric distances or ideal time consuming. However, other real factors like…

Human-Computer Interaction · Computer Science 2014-04-04 Jiyi Li

We propose a new task of recommending touristic locations based on a user's visiting history in a geographically remote region. This can be used to plan a touristic visit to a new city or country, or by travel agencies to provide…

Information Retrieval · Computer Science 2024-10-30 Maarten Clements , Pavel Serdyukov , Arjen P. de Vries , Marcel J. T. Reinders

We survey recent advances in algorithms for route planning in transportation networks. For road networks, we show that one can compute driving directions in milliseconds or less even at continental scale. A variety of techniques provide…

Data Structures and Algorithms · Computer Science 2015-04-21 Hannah Bast , Daniel Delling , Andrew Goldberg , Matthias Müller-Hannemann , Thomas Pajor , Peter Sanders , Dorothea Wagner , Renato F. Werneck

Point-Of-Interest (POI) recommendation aims to mine a user's visiting history and find her/his potentially preferred places. Although location recommendation methods have been studied and improved pervasively, the challenges w.r.t employing…

Computers and Society · Computer Science 2017-01-04 Saeid Hosseini , Hongzhi Yin , Xiaofang Zhou , Shazia Sadiq

Nowadays, with advanced information technologies deployed citywide, large data volumes and powerful computational resources are intelligentizing modern city development. As an important part of intelligent transportation, route…

Artificial Intelligence · Computer Science 2024-04-09 Shiming Zhang , Zhipeng Luo , Li Yang , Fei Teng , Tianrui Li

Over the past decade, GPS enabled traffic applications, such as Google Maps and Waze, have become ubiquitous and have had a significant influence on billions of daily commuters' travel patterns. A consequence of the online route suggestions…

Optimization and Control · Mathematics 2021-09-21 Devansh Jalota , Dario Paccagnan , Maximilian Schiffer , Marco Pavone

We study informative path planning (IPP) with travel budgets in cluttered environments, where an agent collects measurements of a latent field modeled as a Gaussian process (GP) to reduce uncertainty at target locations. Graph-based solvers…

Robotics · Computer Science 2026-01-27 Avraiem Iskandar , Shamak Dutta , Kevin Murrant , Yash Vardhan Pant , Stephen L. Smith

This paper presents an optimization procedure to choose a parking facility according to different criteria: total travel time including transfers, parking fee and a factor depending on the risk of not having an available spot in the parking…

Optimization and Control · Mathematics 2025-02-03 Juan A Mesa , Francisco A Ortega , Miguel A Pozo , Ramón Piedra-de-la-Cuadra