Search arXivSearch

arXiv · 2210.00490

Incentive Mechanism and Path Planning for UAV Hitching over Traffic Networks

Abstract

Package delivery via the UAVs is a promising transport mode to provide efficient and green logistic services, especially in urban areas or complicated topography. However, the energy storage limit of the UAV makes it difficult to perform long-distance delivery tasks. In this paper, we propose a novel multimodal logistics framework, in which the UAVs can call on ground vehicles to provide hitch services to save their own energy and extend their delivery distance. This multimodal logistics framework is formulated as a two-stage model to jointly consider the incentive mechanism design for ground vehicles and path planning for UAVs. In Stage I, to deal with the motivations for ground vehicles to assist UAV delivery, a dynamic pricing scheme is proposed to best balance the vehicle response time and payments to ground vehicles. It shows that a higher price should be decided if the vehicle response time is long to encourage more vehicles to offer a ride. In Stage II, the task allocation and path planning of the UAVs over traffic network is studied based on the vehicle response time obtained in Stage I. To address pathfinding with restrictions and the performance degradation of the pathfinding algorithm due to the rising number of conflicts in multi-agent pathfinding, we propose the suboptimal conflict avoidance-based path search (CABPS) algorithm, which has polynomial time complexity. Finally, we validate our results via simulations. It is shown that our approach is able to increase the success rate of UAV package delivery. Moreover, we estimate the delivery time of the UAV in a pessimistic case, it is still twice as fast as the delivery time of the ground vehicle only.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ziyi Lu, Na Yu, Xuehe Wang. 2022-10-02. Incentive Mechanism and Path Planning for UAV Hitching over Traffic Networks. https://arxiv.org/abs/2210.00490

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Ensuring Stability of Non-Minimal Modes in Input-Output Data-Driven Representation

Many recent data-driven control approaches for linear time-invariant systems are based on output trajectory prediction using input-output data matrices. The system dynamics described by this predictor, which we refer to as the input-output data-driven representation, yields non-unique autoregressive with exogenous inputs (ARX) models having possibly unstable non-minimal modes. In this note, we show that the stability of these non-minimal modes is ensured by a certain choice of ARX model, which coincides with the minimum-norm least-squares predictor using the Moore-Penrose inverse of the data matrix. This stability guarantee holds regardless of the underlying system's stability. Moreover, the stability persists under sufficiently small noise in data when a suitably truncated Moore-Penrose inverse is used. Consequently, the ARX model need not be reduced to the true system order in order to avoid unstable additional modes.

eess.SY

Optimization-Based Formation Flight on Libration Point Orbits

A model predictive control (MPC) framework is developed for station-keeping in spacecraft formation flight along libration point orbits. At each control period, the MPC policy solves a multi-vehicle optimal control problem (MVOCP) that tracks a reference trajectory, while enforcing path constraints on the relative motion of the formation. The control policy makes use of a limited set of control nodes consistent with operational constraints that allow only a small number of maneuver opportunities per revolution. To promote recursive feasibility, path constraints are progressively tightened across the prediction horizon. An isoperimetric reformulation of the constraints is used to prevent inter-sample violations. The resulting MVOCP is a nonconvex program, which is solved via sequential convex programming. The proposed approach is evaluated in a high-fidelity ephemeris model under uncertainties for a formation along the near-rectilinear halo orbit (NRHO), and subject to path constraints on inter-spacecraft separation and relative Sun phase angle. The results demonstrate maintenance of a spacecraft formation that satisfies the path constraints with realistic cumulative propellant consumption.

eess.SY

Certificates Synthesis for A Class of Observational Properties in Stochastic Systems: A Unified Approach

In this paper, we investigate the probabilistic formal verification of stochastic dynamical systems over continuous state spaces. Motivated by problems in state estimation and information-flow security, we introduce the notion of observational properties, which characterize the inferences an external observer can draw from system outputs. These properties are formulated as probabilistic hyperproperties based on HyperLTL over finite traces, yielding a unified framework that subsumes several existing notions studied separately in the literature. We reduce the verification problem to reachability analysis over an augmented structure that integrates the system dynamics with an automaton representation of the specification. Building on this construction, we develop stochastic barrier certificates that provide probabilistic guarantees for property satisfaction while avoiding explicit state-space discretization. The effectiveness of the proposed framework is demonstrated through a case study.

eess.SY