Search Results (334)

Air Traffic Flow Management (ATFM) delay refers to the difference between a flight’s Target Take-Off Time (TTOT) and its Calculated Take-Off Time (CTOT), reflecting congestion levels in the air traffic network. ATFM delays are assigned to balance demand and capacity at key points in the network. The traditional First-Come, First-Served (FCFS) approach allocates delays strictly in the order flights are ready to depart, which is simple but inflexible. This study proposes a dynamic priority-based aircraft sequencing method at critical waypoints under multi-resource scenarios, aiming to reduce ATFM delays. An improved Constrained Position Shifting (CPS) constraint is introduced into the optimization model to enhance the influence of flight priority during decision-making. Additionally, three different priority strategies are designed to compare their respective impacts on ATFM delay. Finally, a dynamic priority-based ATFM delay optimization model is developed to address the identified challenges. Experimental results demonstrate that, compared with the FCFS scheme, the three priority strategies achieve maximum ATFM delay reductions of 30.5%, 44.1%, and 19.9%, respectively. The proposed model effectively allocates shorter delays to critical flights, optimizing resource utilization and improving the operational efficiency of the air route network. The research provides a reference framework for air traffic managers in allocating spatiotemporal resources across multiple congestion hotspots. By aligning priorities with network-wide efficiency goals, it overcomes traditional model limitations, avoids local optima, and supports globally optimal ATFM policy and practice. Full article

Airport congestion in metropolitan clusters (Metroplex systems) poses significant challenges, particularly when capacity reductions occur due to adverse weather conditions. This study introduces a two-stage robust optimization model aimed at improving the robustness of flight slot allocation in multi-airport systems under such uncertainties. In the first stage, the model minimizes deviations from requested slots while respecting airport and waypoint capacities, turnaround times, and adjustment limits. The second stage dynamically adjusts slot allocations to minimize worst-case displacement costs under potential capacity constraints, ensuring robustness against disruptions. The model is validated using real data from the Beijing–Tianjin–Hebei Metroplex, which includes 468 peak-hour flights. The results demonstrate the model’s effectiveness in eliminating demand–capacity violations, particularly at critical airports such as Beijing Daxing, where initial peak demand exceeded capacity by 36.2%. Post-optimization, the model ensures dynamic capacity adherence and adaptive resource allocation, with varying adjustment intensities across airports (12.7% at Beijing Capital, 28.4% at Daxing, and 39.0% at Tianjin Binhai). Compared to a single-stage robust optimization approach, the two-stage model reduces worst-case displacement by 28.2%, highlighting its superior adaptability. This computationally efficient framework, solved via Gurobi 12.0.2/Python 3.11.9, enhances operational robustness through integrated waypoint modeling and a two-stage decision architecture. Full article

Sustainable path-planning algorithms are essential for executing complex user-defined missions by mobile robots. Addressing various scenarios with a unified criterion during the design phase is often impractical due to the potential for unforeseen situations. Therefore, it is important to incorporate the concept of adaptive autonomy for path planning. This approach allows the system to autonomously select the best path-planning strategy. The technique utilizes dynamic programming with an adaptive memory size, leveraging a cellular decomposition technique to divide the map into convex cells. The path is divided into three segments: the first segment connects the starting point to the center of the starting cell, the second segment connects the center of the goal cell to the goal point, and the third segment connects the center of the starting cell to the center of the goal cell. Since each cell is convex, internal path planning simply requires a straight line between two points within a cell. Path planning uses an improved $A^{\ast }$ (I-$A^{\ast }$) algorithm, which evaluates the feasibility of a direct path to the goal from the current position during execution. When a direct path is discovered, the algorithm promptly returns and saves it in memory. The memory size is proportional to the square of the total number of cells, and it stores paths between the centers of cells. By storing and reusing previously calculated paths, this method significantly reduces redundant computation and supports long-term sustainability in mobile robot deployments. The final phase of the path-planning process involves pruning, which eliminates unnecessary waypoints. This approach obviates the need for repetitive path planning across different scenarios thanks to its compact memory size. As a result, paths can be swiftly retrieved from memory when needed, enabling efficient and prompt navigation. Simulation results indicate that this algorithm consistently outperforms other algorithms in finding the shortest path quickly. Full article

As the IMO and the EU strengthen carbon emission regulations, eco-friendly voyage planning is increasingly recognized by ship owners as one of the most important performance factors of the vessel fleet. The eco-friendly voyage planning aims to reduce carbon emissions and fuel consumption while satisfying voyage constraints. In this study, a novel route waypoint optimization method is proposed, which combines a fuel consumption forecasting model based on the Transformer and a Proximal Policy Optimization (PPO) algorithm for adaptive waypoint planning. The developed framework suggests a multi-objective methodology unlike the traditional approaches where a single objective is sought after, which characterizes fuel efficiency against navigational safety and operational simplicity. The methodology consists of three sequential phases. First, the transformer model is employed to predict ship fuel consumption using navigational and environmental data. Next, the predicted consumption values are utilized as a reward function in a PPO-based reinforcement learning framework to generate fuel-efficient routes. Finally, the number and placement of waypoints are further optimized with respect to terrain and bathymetric constraints, improving the practicality and safety of the navigational plan. The results show that the proposed method could decrease average fuel consumption by up to 11.33% across three real-world case studies: Busan–Rotterdam, Busan–Los Angeles, and Mokpo–Houston, compared to AIS-based routes. The transformer model outperformed Long Short-Term Memory (LSTM) and Random Forest baselines with the highest prediction accuracy, achieving an R² score of 86.75%. This study is the first to incorporate transformer-based forecasting into reinforcement learning for maritime route planning and demonstrates how the method adaptively controls waypoint density in response to environmental and geographical conditions. These results support the practical application of the approach in smart ship navigation systems aligned with IMO’s decarbonization goals. Full article

A great ellipse route (GER), as one of the fundamental routes for ocean voyages, directly influences the actual voyage distance and the complexity of vessel maneuvering through the location and number of its waypoints. Against the backdrop of global warming, the melting of Arctic sea ice has accelerated the opening of the Arctic shipping route. This paper addresses the issue of how to reasonably segment and adopt rhumb line routes to approximate the GER in the special navigational environment of the Arctic. Using historical routes, recommended routes, and geospatial data that have passed through the Arctic shipping lane as constraints, this paper proposes a waypoint optimization model based on an adaptive hybrid particle swarm optimization-genetic algorithm (AHPSOGA). Additionally, by integrating Arctic remote sensing ice condition data and the Polar Operational Limit Assessment Risk Indexing System (POLARIS), a safety assessment model tailored for this route has been developed, enabling the quantification of sea ice risks and dynamic evaluation of segment safety. Experimental results indicate that the proposed waypoint optimization model reduces the number of waypoints and voyage distance compared to recommended routes and conventional shipping industry methods. Furthermore, the AHPSOGA algorithm achieves a 16.41% and 19.19% improvement in convergence speed compared to traditional GA and PSO algorithms, respectively. In terms of computational efficiency, the average runtime is improved by approximately 12.00% and 14.53%, respectively. The risk levels of each segment of the optimized route are comparable to those of the recommended Northeast Passage route. This study provides an effective theoretical foundation and technical support for intelligent planning and decision-making for Arctic shipping routes. Full article

Petroglyph motifs from 23 sites and 37 panels in northern Georgia and western North Carolina foothills and mountains are analyzed within their archaeological, ethnographic, and landscape contexts. The Track Rock Tradition comprises 10 chronologically sequenced marking categories: (1) Cupules/Meanders/Open Circles; (2) Soapstone Extraction cars; (3) Vulva Shapes; (4) Figures; (5) Feet/Hands/Tracks; (6) Nested Circles; (7) Cross-in-Circles; (8) Spirals; (9) Straight Lines; and (10) Thin Incised Lines. Dating spans approximately 3800 years. Early cupules and meanders predate 3000 years ago, truncated by Late Archaic soapstone extraction. Woodland period (3000–1050 years ago) motifs include vulva shapes, figures, feet, tracks, and hands. Early Mississippian concentric circles date to 1050–600 years ago, while Middle Mississippian cross-in-circles span 600–350 years ago. Late Mississippian spirals (350–200 years ago) and post-contact metal tool incisions represent the most recent phases. The Track Rock Tradition differs from western Trapp and eastern Hagood Mill traditions. Given the spatial overlap with Iroquoian-speaking Cherokee territory, motifs are interpreted through Cherokee beliefs, supplemented by related Muskogean Creek ethnography. In Cherokee cosmology, the matrilocal Thunderers hierarchy includes the Female Sun/Male Moon, Selu (Corn Mother)/Kanati (Lucky Hunter), Medicine Woman/Judaculla (Master of Game), and Little People families. Ritual practitioners served as intermediaries between physical and spirit realms through purification, fasting, body scratching, and rock pecking. Meanders represent trails, rivers, and lightning. Cupules and lines emphasize the turtle appearance of certain rocks. Vulva shapes relate to fertility, while tracks connect to life-giving abilities. Concentric circles denote townhouses; cross-in-circles and spirals represent central fires. The tradition shows continuity in core beliefs despite shifting emphases from hunting (Woodland) to corn cultivation (Mississippian), with petroglyphs serving as necessary waypoints for spiritual supplicants. Full article

Multi-vessel formation shipping demonstrates significant potential for enhancing maritime transportation efficiency and economy. However, existing route planning systems inadequately address the unique challenges of formations, where traditional methods fail to integrate global optimality, local dynamic obstacle avoidance, and formation coordination into a cohesive system. Global planning often neglects multi-ship collaborative constraints, while local methods disregard vessel maneuvering characteristics and formation stability. This paper proposes GLFM, a three-layer hierarchical framework (global optimization–local adjustment-formation collaboration module) for intelligent route planning of transport ship formations. GLFM integrates an improved multi-objective A* algorithm for global path optimization under dynamic meteorological and oceanographic (METOC) conditions and International Maritime Organization (IMO) safety regulations, with an enhanced Artificial Potential Field (APF) method incorporating ship safety domains for dynamic local obstacle avoidance. Formation, structural stability, and coordination are achieved through an improved leader–follower approach. Simulation results demonstrate that GLFM-generated trajectories significantly outperform conventional routes, reducing average risk level by 38.46% and voyage duration by 12.15%, while maintaining zero speed and period violation rates. Effective obstacle avoidance is achieved, with the leader vessel navigating optimized global waypoints and followers maintaining formation structure. The GLFM framework successfully balances global optimality with local responsiveness, enhances formation transportation efficiency and safety, and provides a comprehensive solution for intelligent route optimization in multi-constrained marine convoy operations. Full article

A multi-objective optimal trajectory planning method is proposed for manipulators in this paper to enhance motion efficiency and to reduce component wear while ensuring motion smoothness. The trajectory is initially interpolated in the joint space by using quintic non-uniform B-splines with virtual points, achieving the C⁴ continuity of joint motion and satisfying dynamic, kinematic, geometric, synchronization, and boundary constraints. The interpolation reformulates the trajectory planning problem into an optimization problem, where the time intervals between desired adjacent waypoints serve as variables. Travelling time and the integral of the squared jerk along the entire trajectories comprise the multi-objective functions. A constrained multi-objective dream optimization algorithm is designed to solve the time–jerk optimal trajectory planning problem and generate Pareto solutions for optimized trajectories. Simulations conducted on 6-DOF manipulators validate the effectiveness and superiority of the proposed method in comparison with existing typical trajectory planning methods. Full article

We introduce a waypoint-based flow capture location model (WbFCLM) for siting facilities on networks with the objective of maximally capturing flows. The advantages of the waypoint-based formulation are that (1) demand is modeled along observed trajectories rather than assumed travel paths, and (2) demand is allowed to vary across geographic space. We demonstrate the WbFCLM using a test dataset derived from vehicle tracking data. Though solving the WbFCLM can require considerable computing power, it can be used to site facilities on networks where both flows and demand vary spatially. Full article

Unmanned Aerial Vehicles (UAVs) face significant challenges in global path planning within complex terrains, as traditional algorithms (e.g., A*, PSO, APF) struggle to balance computational efficiency, path optimality, and safety. This study proposes a Voronoi–A* fusion algorithm, combining Voronoi-vertex-based rapid trajectory generation with A* supplementary expansion for enhanced performance. First, an adaptive DEM layering strategy divides the terrain into horizontal planes based on obstacle density, reducing computational complexity while preserving 3D flexibility. The Voronoi vertices within each layer serve as a sparse waypoint network, with greedy heuristic prioritizing vertices that ensure safety margins, directional coherence, and goal proximity. For unresolved segments, A* performs localized searches to ensure complete connectivity. Finally, a line-segment interpolation search further optimizes the path to minimize both length and turning maneuvers. Simulations in mountainous environments demonstrate superior performance over traditional methods in terms of path planning success rates, path optimality, and computation. Our framework excels in real-time scenarios, such as disaster rescue and logistics, although it assumes static environments and trades slight path elongation for robustness. Future research should integrate dynamic obstacle avoidance and weather impact analysis to enhance adaptability in real-world conditions. Full article

Robotic search of people in human-centered environments, including healthcare settings, is challenging, as autonomous robots need to locate people without complete or any prior knowledge of their schedules, plans, or locations. Furthermore, robots need to be able to adapt to real-time events that can influence a person’s plan in an environment. In this paper, we present MLLM-Search, a novel zero-shot person search architecture that leverages multimodal large language models (MLLM) to address the mobile robot problem of searching for a person under event-driven scenarios with varying user schedules. Our approach introduces a novel visual prompting method to provide robots with spatial understanding of the environment by generating a spatially grounded waypoint map, representing navigable waypoints using a topological graph and regions by semantic labels. This is incorporated into an MLLM with a region planner that selects the next search region based on the semantic relevance to the search scenario and a waypoint planner that generates a search path by considering the semantically relevant objects and the local spatial context through our unique spatial chain-of-thought prompting approach. Extensive 3D photorealistic experiments were conducted to validate the performance of MLLM-Search in searching for a person with a changing schedule in different environments. An ablation study was also conducted to validate the main design choices of MLLM-Search. Furthermore, a comparison study with state-of-the-art search methods demonstrated that MLLM-Search outperforms existing methods with respect to search efficiency. Real-world experiments with a mobile robot in a multi-room floor of a building showed that MLLM-Search was able to generalize to new and unseen environments. Full article

To address the obstacle-avoidance path-planning requirements of dual-arm robots operating in complex environments, such as chemical laboratories and biomedical workstations, this paper proposes ODSN-RRT (optimization-direction-step-node RRT), an efficient planner based on rapidly-exploring random trees (RRT). ODSN-RRT integrates three key optimization strategies. First, a two-stage sampling-direction strategy employs goal-directed growth until collision, followed by hybrid random-goal expansion. Second, a dynamic safety step-size strategy adapts each extension based on obstacle size and approach angle, enhancing collision detection reliability and search efficiency. Third, an expansion-node optimization strategy generates multiple candidates, selects the best by Euclidean distance to the goal, and employs backtracking to escape local minima, improving path quality while retaining probabilistic completeness. For collision checking in the dual-arm workspace (self and environment), a cylindrical-spherical bounding-volume model simplifies queries to line-line and line-sphere distance calculations, significantly lowering computational overhead. Redundant waypoints are pruned using adaptive segmental interpolation for smoother trajectories. Finally, a master-slave planning scheme decomposes the 14-DOF problem into two 7-DOF sub-problems. Simulations and experiments demonstrate that ODSN-RRT rapidly generates collision-free, high-quality trajectories, confirming its effectiveness and practical applicability. Full article

With the global increase in maritime activities, the frequency of maritime accidents has risen, underscoring the urgent need for faster and more efficient search and rescue (SAR) solutions. This study presents an intelligent unmanned aerial vehicle (UAV)-based maritime rescue system that combines GPS-driven dynamic path planning with vision-based dual-target detection and tracking. Developed within the Gazebo simulation environment and based on modular ROS architecture, the system supports stable takeoff and smooth transitions between multi-rotor and fixed-wing flight modes. An external command module enables real-time waypoint updates. This study proposes three path-planning schemes based on the characteristics of drones. Comparative experiments have demonstrated that the triangular path is the optimal route. Compared with the other schemes, this path reduces the flight distance by 30–40%. Robust target recognition is achieved using a darknet-ROS implementation of the YOLOv4 model, enhanced with data augmentation to improve performance in complex maritime conditions. A monocular vision-based ranging algorithm ensures accurate distance estimation and continuous tracking of rescue vessels. Furthermore, a dual-target-tracking algorithm—integrating motion prediction with color-based landing zone recognition—achieves a 96% success rate in precision landings under dynamic conditions. Experimental results show a 4% increase in the overall mission success rate compared to traditional SAR methods, along with significant gains in responsiveness and reliability. This research delivers a technically innovative and cost-effective UAV solution, offering strong potential for real-world maritime emergency response applications. Full article

By assuming that both travel and departure time are normally distributed variables, a multi-objective stochastic optimization model for the multi-airport flight cooperative scheduling problem (MAFCSP) with CvaR of travel and departure time is firstly proposed. Herein, conflicts of flights from different airports at the same waypoint can be avoided by simultaneously assigning an optimal route to each flight between the airport and waypoint and determining its practical departure time. Furthermore, several real-world constraints, including the safe interval between any two aircraft at the same waypoint and the maximum allowable delay for each flight, have been incorporated into the proposed model. The primary objective is minimization of both total carbon emissions and delay times for all flights across all airports. A feasible set of non-dominated solutions were obtained using a two-stage heuristic approach-based NSGA-II. Finally, we present a case study of four airports and three waypoints in the Beijing–Tianjin–Hebei region of China to test our study. Full article

Hypersonic morphing vehicles (HMVs), renowned for their adaptive structural reconfiguration and cross-domain maneuverability, confront formidable reentry guidance challenges under multiple no-fly zones, stringent path constraints, and nonlinear dynamics exacerbated by morphing-induced aerodynamic uncertainties. To address these issues, this study proposes a hierarchical framework integrating an A-based energy-optimal waypoint planner, a deep deterministic policy gradient (DDPG)-driven morphing policy network, and a quasi-equilibrium glide condition (QEGC) guidance law with continuous sliding mode control. The A* algorithm generates heuristic trajectories circumventing no-fly zones, reducing the evaluation function by 6.2% compared to greedy methods, while DDPG optimizes sweep angles to minimize velocity loss and terminal errors (0.09 km position, 0.01 m/s velocity). The QEGC law ensures robust longitudinal-lateral tracking via smooth hyperbolic tangent switching. Simulations demonstrate generalization across diverse targets (terminal errors < 0.24 km) and robustness under Monte Carlo deviations (0.263 ± 0.184 km range, −12.7 ± 42.93 m/s velocity). This work bridges global trajectory planning with real-time morphing adaptation, advancing intelligent HMV control. Future research will extend this framework to ascent/dive phases and optimize its computational efficiency for onboard deployment. Full article