Abhishek Patil

Mr. Abhishek Patil

Michigan Technological University, Houghton, Michigan, USA
orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 July 2022 in Sensors
Verified
Journal Article
Open access
PDF file
APAbhishek Patil
Abhishek Patil
JBJungyun Bae
Jungyun Bae
MPMyoungkuk Park
Myoungkuk Park
This paper proposes an algorithm that provides operational strategies for multiple heterogeneous mobile robot systems utilized in many real-world applications, such as deliveries, surveillance, search and rescue, monitoring, and transportation. Specifically, the authors focus on developing an algorithm that solves a min–max multiple depot heterogeneous asymmetric traveling salesperson problem (MDHATSP). The algorithm is designed based on a primal–dual technique to operate given multiple heterogeneous robots located at distinctive depots by finding a tour for each robot such that all the given targets are visited by at least one robot while minimizing the last task completion time. Building on existing work, the newly developed algorithm can solve more generalized problems, including asymmetric cost problems with a min–max objective. Though producing optimal solutions requires high computational loads, the authors aim to find reasonable sub-optimal solutions within a short computation time. The algorithm was repeatedly tested in a simulation with varying problem sizes to verify its effectiveness. The computational results show that the algorithm can produce reliable solutions to apply in real-time operations within a reasonable time.

13 June 2023 in Robotics
Verified
Journal Article
Open access
PDF file
APAbhishek Patil
Abhishek Patil
MPMyoungkuk Park
Myoungkuk Park
JBJungyun Bae
Jungyun Bae
This paper proposes an algorithm that provides operational strategies for multiple tethered autonomous underwater vehicle (T-AUV) systems for entanglement-free navigation. T-AUVs can perform underwater tasks under reliable communication and power supply, which is the most substantial benefit of their operation. Thus, if one can overcome the entanglement issues while utilizing multiple tethered vehicles, the potential applications of the system increase including ecosystem exploration, infrastructure inspection, maintenance, search and rescue, underwater construction, and surveillance. In this study, we focus on developing strategies for task allocation, path planning, and scheduling that ensure entanglement-free operations while considering workload balancing among the vehicles. We do not impose restrictions on the size or shape of the vehicles at this stage; our primary focus is on efficient tether management as an initial work on the topic. To achieve entanglement-free navigation, we propose a heuristic based on the primal-dual technique, which enables initial task allocation and path planning while minimizing the maximum travel cost of the vehicles. Although this heuristic often generates sectioned paths due to its workload-balancing nature, we also propose a mixed approach to provide feasible solutions for non-sectioned initial paths. This approach combines entanglement avoidance techniques with time scheduling and sectionalization methods. To evaluate the effectiveness of our algorithm, extensive simulations were conducted with varying problem sizes. The computational results demonstrate the potential of our algorithm to be applied in real-time operations, as it consistently generates reliable solutions within a reasonable time frame.

18 October 2025 in Sensors
Verified
Journal Article
Open access
PDF file
HLHyeseon Lee
Hyeseon Lee
JBJungyun Bae
Jungyun Bae
APAbhishek Patil
Abhishek Patil
MPMyoungkuk Park
Myoungkuk Park
VNVinh Nguyen
Vinh Nguyen
Multi-agent coordination with task allocation, routing, and scheduling presents critical challenges when deploying heterogeneous robotic systems in constrained agricultural environments. These systems involve real-time sensing during their operations with various sensors, and having quick updates on coordination based on sensed data is critical. This paper addresses the specific requirements of harvesting automation through three heuristic approaches: (1) primal–dual workload balancing inspired by combinatorial optimization techniques, (2) greedy task assignment with iterative local optimization, and (3) LLM-based constraint processing through prompt engineering. Our agricultural application scenario incorporates robot size constraints for navigating narrow crop rows while optimizing task completion time. The greedy heuristic employs rapid initial task allocation based on proximity and capability matching, followed by iterative route refinement. The primal–dual approach adapts combinatorial optimization principles from recent multi-depot routing solutions, dynamically redistributing workloads between robots through dual variable adjustments to minimize maximum completion time. The LLM-based method utilizes structured prompt engineering to encode spatial constraints and robot capabilities, generating feasible solutions through successive refinement cycles. We implemented and compared these approaches through extensive simulations. Preliminary results demonstrate that all three approaches produce feasible solutions with reasonable quality. The results demonstrate the potential of the methods for real-world applications that can be quickly adopted into variations of the problem to offer valuable insights into solving complex coordination problems with heterogeneous multi-robot systems.

28 November 2024 in Intelligent Service Robotics
Verified
Journal Article
Closed access
PDF file
APAbhishek Patil
Abhishek Patil
MPMyoungkuk Park
Myoungkuk Park
JBJungyun Bae
Jungyun Bae

20 May 2024
Verified
Thesis
Open access
PDF file
APAbhishek Patil
Abhishek Patil
This dissertation focuses on developing algorithms to solve the problem of coordinating multiple autonomous vehicles under various constraints, aiming to produce practical solutions for real-world applications. Built upon three journal publications addressing two coordination-related problems in different domains, this research document tackles the challenges of heterogeneity constraints and cable entanglement issues encountered by autonomous vehicle systems. The first problem tackles task allocation and path planning for heterogeneous ground mobile vehicles operating in a 2D environment with asymmetric travel costs. By enhancing previous Primal-Dual approximation heuristic methods, novel techniques are introduced to manipulate dual variables and achieve balanced workload distribution, ultimately minimizing the maximum tour cost. The second problem addresses the issue of tether entanglement faced by multiple tethered underwater vehicle systems navigating underwater. A multi-layer heuristic is developed by extending the Primal-Dual heuristic into a 3D environment and incorporating an additional algorithm layer to detect and resolve tether entanglements within a reasonable computation cost. Drawing on insights gained from these two problems, a new versatile algorithm has been developed that is applicable to a range of min-max Multiple Depot Heterogeneous Asymmetric Traveling Salesperson Problems (MDHATSPs). This novel heuristic offers enhanced computational efficiency and practicality by refining formulation and integrating critical constraints, such as cable entanglement. This dissertation has value in providing heuristics for routing problems that involve multiple autonomous vehicles with additional constraints. Each algorithm is developed from problem formulation and considered to improve solution qualities and computation time for implementation in real-world applications.