arXiv subjects

Shapour Azarm

Publications and source records attributed to Shapour Azarm.

4 recordsLinked to original sources

arXiv2025

Data-Driven Prediction of Dynamic Interactions Between Robot Appendage and Granular Material

An alternative data-driven modeling approach has been proposed and employed to gain fundamental insights into robot motion interaction with granular terrain at certain length scales. The approach is based on an integration of dimension reduction (Sequentially Truncated Higher-Order Singular Value Decomposition), surrogate modeling (Gaussian Process), and data assimilation techniques (Reduced Order Particle Filter). This approach can be used online and is based on offline data, obtained from the offline collection of high-fidelity simulation data and a set of sparse experimental data. The results have shown that orders of magnitude reduction in computational time can be obtained from the proposed data-driven modeling approach compared with physics-based high-fidelity simulations. With only simulation data as input, the data-driven prediction technique can generate predictions that have comparable accuracy as simulations. With both simulation data and sparse physical experimental measurement as input, the data-driven approach with its embedded data assimilation techniques has the potential in outperforming only high-fidelity simulations for the long-horizon predictions. In addition, it is demonstrated that the data-driven modeling approach can also reproduce the scaling relationship recovered by physics-based simulations for maximum resistive forces, which may indicate its general predictability beyond a case-by-case basis. The results are expected to help robot navigation and exploration in unknown and complex terrains during both online and offline phases.

cs.RO↗

arXiv2024

A Two-Stage Reactive Auction Framework for the Multi-Depot Rural Postman Problem with Dynamic Vehicle Failures

Although unmanned vehicle fleets offer efficiency in transportation, logistics and inspection, their susceptibility to failures poses a significant challenge to mission continuity. We study the Multi-Depot Rural Postman Problem with Rechargeable and Reusable Vehicles (MD-RPP-RRV) with vehicle failures, where unmanned rechargeable vehicles placed at multiple depots with capacity constraints may fail while serving arc-based demands. To address unexpected vehicle breakdowns during operation, we propose a two-stage real-time rescheduling framework. First, a centralized auction quickly generates a feasible rescheduling solution; for this stage, we derive a theoretical additive bound that establishes an analytical guarantee on the worst-case rescheduling penalty. Second, a peer auction refines this baseline through a problem-specific magnetic field router for local schedule repair, utilizing parameters calibrated via sensitivity analysis to ensure controlled computational growth. We benchmark this approach against a simulated annealing metaheuristic to evaluate solution quality and execution speed. Experimental results on 257 diverse failure scenarios demonstrate that the framework achieves an average runtime reduction of over 95\% relative to the metaheuristic baseline, cutting rescheduling times from hours to seconds while maintaining high solution quality. The two-stage framework excels on large-scale instances, surpassing the centralized auction in nearly 80\% of scenarios with an average solution improvement exceeding 12\%. Moreover, it outperforms the simulated annealing mean and best results in 59\% and 28\% of scenarios, respectively, offering the robust speed-quality trade-off required for real-time mission continuity.

cs.RO↗

arXiv2024

Cost-Benefit Analysis using Modular Dynamic Fault Tree Analysis and Monte Carlo Simulations for Condition-based Maintenance of Unmanned Systems

Recent developments in condition-based maintenance (CBM) have helped make it a promising approach to maintenance cost avoidance in engineering systems. By performing maintenance based on conditions of the component with regards to failure or time, there is potential to avoid the large costs of system shutdown and maintenance delays. However, CBM requires a large investment cost compared to other available maintenance strategies. The investment cost is required for research, development, and implementation. Despite the potential to avoid significant maintenance costs, the large investment cost of CBM makes decision makers hesitant to implement. This study is the first in the literature that attempts to address the problem of conducting a cost-benefit analysis (CBA) for implementing CBM concepts for unmanned systems. This paper proposes a method for conducting a CBA to determine the return on investment (ROI) of potential CBM strategies. The CBA seeks to compare different CBM strategies based on the differences in the various maintenance requirements associated with maintaining a multi-component, unmanned system. The proposed method uses modular dynamic fault tree analysis (MDFTA) with Monte Carlo simulations (MCS) to assess the various maintenance requirements. The proposed method is demonstrated on an unmanned surface vessel (USV) example taken from the literature that consists of 5 subsystems and 71 components. Following this USV example, it is found that selecting different combinations of components for a CBM strategy can have a significant impact on maintenance requirements and ROI by impacting cost avoidances and investment costs.

q-fin.CP↗

arXiv2023

Multi-trip algorithm for multi-depot rural postman problem with rechargeable vehicles

This paper studies an extension of the rural postman problem with multiple depots and rechargeable and reusable vehicles capable of multiple trips with capacity constraints. This paper presents a new Mixed Integer Linear Programming (MILP) formulation to find optimal solutions to the problem. The paper also proposes a new heuristic called the multi-trip algorithm for the problem whose solutions are compared against solutions of heuristics from literature and the optimal solutions obtained from the MILP formulation by testing them on both benchmark instances and real-world instances generated from road maps. Results show that the proposed heuristic was able to solve all the instances and produce better solutions than heuristics from the literature on 37 of 39 total instances. Due to the high requirement of memory and compute power, the Gurobi optimizer used for solving the MILP formulation, although it produced optimal solutions, was only able to solve benchmark instances but not real-world instances.

cs.MA↗