Faster algorithms for orienteering and k-TSP

Gottlieb, Lee-Ad; Krauthgamer, Robert; Rika, Havana

doi:10.1016/j.tcs.2022.02.013

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article2

Other1

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Novel Properties of Hierarchical Probabilistic Partitions and Their Algorithmic Applications

Banerjee,

Bartal,

Gottlieb

et al. 2024

2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)

View full text Add to dashboard Cite

Novel Properties of Hierarchical Probabilistic Partitions and Their Algorithmic Applications

Banerjee,

Bartal,

Gottlieb

et al. 2024

2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)

View full text Add to dashboard Cite

A Data-Driven Crowdsensing Framework for Parking Violation Detection

Luan,

Wang,

Jiang

et al. 2024

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

Drone-Based Bug Detection in Orchards with Nets: A Novel Orienteering Approach

Betti Sorbelli,

Coró,

Das

et al. 2024

ACM Trans. Sen. Netw.

View full text Add to dashboard Cite

The use of drones for collecting information and detecting bugs in orchards covered by nets is a challenging problem. The nets help in reducing pest damage, but they also constrain the drone’s flight path, making it longer and more complex. To address this issue, we model the orchard as an aisle-graph, a regular data structure that represents consecutive aisles where trees are arranged in straight lines. The drone flies close to the trees and takes pictures at specific positions for monitoring the presence of bugs, but its energy is limited, so it can only visit a subset of positions. To tackle this challenge, we introduce the Single-drone Orienteering Aisle-graph Problem (SOAP), a variant of the orienteering problem, where likely infested locations are prioritized by assigning them a larger profit. Additionally, the drone’s movements have a cost in terms of energy, and the objective is to plan a drone’s route in the most profitable locations under a given drone’s battery. We show that SOAP can be optimally solved in polynomial time, but for larger orchards/instances, we propose faster approximation and heuristic algorithms. Finally, we evaluate the algorithms on synthetic and real data sets to demonstrate their effectiveness and efficiency.

show abstract

Faster algorithms for orienteering and k-TSP

Cited by 3 publications

References 20 publications

Novel Properties of Hierarchical Probabilistic Partitions and Their Algorithmic Applications

Novel Properties of Hierarchical Probabilistic Partitions and Their Algorithmic Applications

A Data-Driven Crowdsensing Framework for Parking Violation Detection

Drone-Based Bug Detection in Orchards with Nets: A Novel Orienteering Approach

Contact Info

Product

Resources

About