The growing affordability, autonomy, and swarming of small unmanned aerial vehicles (UAVs) turn low-altitude defense from single-shot interception into a multi-node cooperative decision problem, in which the loss of sensing, coordination, or engagement nodes breaks the closed loops linking them. This study formulates their recovery as the dynamic reconfiguration of cooperative counter-UAV task chains. Given a pre-disturbance plan and a set of failed defending nodes, reconfiguration is modeled as a constrained bi-objective optimization balancing recovered engagement effectiveness against the change to the baseline plan and is solved by Multi-Agent Heuristic Evolution (MAHE), an automated heuristic design framework whose evolution, coordinator, repair, and reflection agents—driven by a large language model—evolve scoring heuristics for a fixed reconfiguration solver. Across instances of varying scale and under light-to-heavy node loss conditions, MAHE outperforms both a single-agent heuristic design counterpart and a range of hand-crafted solvers: on ten held-out test instances spanning 8–320 targets it attains the highest overall normalized hypervolume (0.947, versus 0.935 for the single-agent counterpart and 0.30–0.45 for the hand-crafted solvers) and the best mean rank (1.43 of six methods, p<10−5); the hand-crafted solvers lose most of their solution quality as the problem grows, whereas MAHE preserves it and sustains high recovery at a nearly constant reconfiguration cost. An ablation confirms that its agents contribute complementary gains. These simulation results indicate that automatically generated, reconfiguration-specific heuristics offer a scalable algorithmic foundation for dynamic, heterogeneous, and constraint-intensive counter-UAV task-chain reconfiguration.
Yihao Zhong, Changsheng Yin, Ruopeng Yang et al.· Drones· 0 citations
Post-disaster emergency communication recovery is not merely a link-repair task but a high-level planning problem constrained by service priorities, inter-object dependencies, resource budgets, and time windows. Existing restoration optimization methods generally rely on fully structured inputs, whereas direct large language model (LLM) planning may produce fluent candidates that violate encoded prerequisites, stage-order relations, budget limits, or temporal constraints. To address this challenge, we propose ICG-Restore, an intent-constrained, graph-enhanced LLM planning framework with rule-consistent minimal-edit repair. ICG-Restore transforms mixed restoration requests and structured network observations into task packages that can be checked for validator-level feasibility under an encoded high-level constraint model and evaluated by downstream abstract executors or schedulers. The framework compiles natural-language requests, structured observations, and operational rules into a task-intent object; retrieves task-relevant context from a heterogeneous scenario graph and a restoration knowledge graph; generates stage-wise restoration candidates; and applies bounded local corrections to candidates that violate encoded constraints. In this paper, “minimal-edit” is a descriptive label for a bounded local repair principle that prioritizes less disruptive corrections. Candidates accepted by the validators are evaluated and ranked by a safety-aware agent executor operating in an abstract restoration action space. Experiments on controlled abstract topologies covering three scales, four restoration tasks, and five environmental evolution modes show that ICG-Restore improves validator-level constraint satisfaction and benchmark-estimated recovery utility. Compared with Direct-LLM, it improves CSR and CRS by 1.99% and 24.56%, respectively; benchmark-specific WCTC@5 structural-alignment diagnostic increases by 38.87%.
Jinyin Bai, Wei Zhu, Xiangchen Wang et al.· Applied Informatics· 0 citations
Accurate extraction of road networks from high-resolution remote sensing imagery is a fundamental task underpinning autonomous-driving navigation, urban spatial planning, and the dynamic updating of geographic information databases. Although existing road extraction methods attain outstanding pixel-level segmentation accuracy and topological integrity, most follow an accuracy-first design paradigm that relies on heavyweight backbones and increasingly complex decoders, incurring a parameter volume and storage overhead that constitute the principal bottleneck for deploying them on resource-constrained edge platforms such as unmanned aerial vehicles, mobile terminals, and onboard satellite processors. Conversely, models that pursue extreme lightweighting often fail to preserve the thin, continuous, linear structure of roads, tending to produce topological breaks in the extracted road networks. To bridge the performance gap between segmentation accuracy and model size, we propose LOA-Net, a lightweight orientation-aware road extraction network. LOA-Net introduces a Road-Aligned Deformable Convolution (RA-DCN) that adaptively aligns the sampling region with the road geometry and explicitly supervises the predicted road orientation, thereby accurately capturing road connectivity while substantially reducing the parameter count. Experiments on the CHN6-CUG and DeepGlobe benchmarks show that LOA-Net surpasses representative state-of-the-art methods on both IoU and F1, while achieving the lowest parameter count of all compared models and a computational complexity comparable to its peers, striking an excellent trade-off between segmentation performance and a mobile-friendly footprint that makes it well suited for road extraction from remote sensing imagery in resource-constrained scenarios.
Bo Huang, Yiwei Lu, Zizhuo Li et al.· Remote Sensing· 0 citations
FossilWriter represents the story world as a shared hypergraph and introduces a narrative layer that marks elements with developmental potential that grows during writing and serves as the single source of truth to ensure long-range consistency.
Heng Zhang, Yihao Zhong, Lubin Gan et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
