SearcharxivSearch

arXiv subjects

Weibo Yang

Publications and source records attributed to Weibo Yang.

5 recordsLinked to original sources

KC-BFPRL: Knowledge-Guided Multi-UAV Collaboration for Grassland Restoration via Bilevel Formerpointer-Based Reinforcement Learning

Multi-unmanned aerial vehicle (UAV) systems provide scalable service platforms for large-scale environmental tasks, such as grassland ecosystem restoration. However, coordinating fleet operations requires solving the restoration area maximization problem (RAMP). This non-linear combinatorial optimization challenge is complicated by payload-dependent energy dynamics and heterogeneous ecological degradation. We propose a novel knowledge-guided collaborative bilevel formerpointer reinforcement learning framework (KC-BFPRL) to address this complexity. Using a hierarchical paradigm, KC-BFPRL decomposes RAMP into global task allocation and local restoration planning, with the latter further divided into upper-level trajectory planning and lower-level restoration area allocation. Our specialized architecture pairs featuring a Transformer-based encoder that fuses static environmental features with dynamic UAV states, and a Pointer Network decoder trained via a robust actor-critic framework. By embedding ecological priority rules and heuristic logic, KC-BFPRL achieves a structured warm-start, solving the RL cold-start problem while ensuring strict constraint satisfaction. Extensive experiments demonstrate that KC-BFPRL consistently outperforms state-of-the-art baselines, achieving superior objective values and efficiency. It maintains a $0.00\%$ optimality gap in the most complex scenarios U8-R160 and operates nearly three times faster than MAPDP, validating its robustness, scalability, and real-time applicability for large-scale automated ecological restoration.

cs.MA

Simulations of interaction between outflow and surrounding broken power-law circumnuclear medium: implications for different radio light curves of TDEs

The complex radio light curves of tidal disruption events (TDEs) challenge our understanding of the properties of both the outflows and the circumnuclear medium (CNM) surrounding supermassive black holes. In this work, we explore outflow-CNM interactions across a broad parameter space using three-dimensional hydrodynamic simulations, adopting a broken power-law CNM density profile with a transition near the Bondi radius. The outflow-CNM interaction inside Bondi radius produces an early radio flare (\(\lesssim 2\) yr) once the emitting region becomes optically thin. A second radio rebrightening can appear a few years later if the outflow decelerates beyond Bondi radius. We also find that either a very dense inner CNM, which causes rapid deceleration, or a rarefied outer CNM suppresses the late rebrightening that will produces a single early-peaked flare. In contrast, a rarefied CNM inside the Bondi radius suppresses the early flare and yields a single late-peaked event. For the case of very dense CNM at large radii, the interaction will trigger a sharp late-time rise as observed in some TDEs. We further explore the interaction of a relativistic jet with a broken power-law CNM, which can reproduce the characteristic light curves as observed in jetted TDEs without invoking complex jet structure.

astro-ph.HE

Simulations on the collision between debris stream and outer dusty torus: a possible channel for forming fast-rise and long-delayed radio outburst in tidal disruption events

The geometrically thick dusty torus structure is believed to exist in the nuclear region of galaxies (especially in active galactic nuclei, AGNs). The debris stream from a tidal disruption event (TDE) will possibly collide with the dusty torus and produce a transient flare. We perform three-dimensional hydrodynamic simulations to model the dynamical evolution of the interaction between unbound debris and dusty torus. During the continuous interaction, the shocked material will be spilled out from the interaction region and form an outflow. We calculate the temporal evolution of synchrotron emission by assuming that the shock accelerates a fraction of electrons in the outflow into a non-thermal distribution. We find that radio emission from the debris-torus collision generates a steep-rise and slow-decline radio light curve due to the sharp edge and dense gas of dusty torus, where the radio outburst delays the main optical/X-ray outburst by several years or even several tens of years. We apply our model to a TDE that happened in a narrow-line Seyfert I (PS16dtm), where both the radio spectrum and the light curve can be roughly reproduced. Future high-sensitivity, wide-field-of-view radio surveys have the opportunity to detect more such radio flares.

astro-ph.HE

A UAV-Enabled Time-Sensitive Data Collection Scheme for Grassland Monitoring Edge Networks

Grassland monitoring is essential for the sustainable development of grassland resources. Traditional Internet of Things (IoT) devices generate critical ecological data, making data loss unacceptable, but the harsh environment complicates data collection. Unmanned Aerial Vehicle (UAV) and mobile edge computing (MEC) offer efficient data collection solutions, enhancing performance on resource-limited mobile devices. In this context, this paper is the first to investigate a UAV-enabled time-sensitive data collection problem (TSDCMP) within grassland monitoring edge networks (GMENs). Unlike many existing data collection scenarios, this problem has three key challenges. First, the total amount of data collected depends significantly on the data collection duration and arrival time of UAV at each access point (AP). Second, the volume of data at different APs varies among regions due to differences in monitoring objects and vegetation coverage. Third, the service requests time and locations from APs are often not adjacent topologically. To address these issues, We formulate the TSDCMP for UAV-enabled GMENs as a mixed-integer programming model in a single trip. This model considers constraints such as the limited energy of UAV, the coupled routing and time scheduling, and the state of APs and UAV arrival time. Subsequently, we propose a novel cooperative heuristic algorithm based on temporal-spatial correlations (CHTSC) that integrates a modified dynamic programming (MDP) into an iterated local search to solve the TSDCMP for UAV-enabled GMENs. This approach fully takes into account the temporal and spatial relationships between consecutive service requests from APs. Systematic simulation studies demonstrate that the mixed-integer programming model effectively represents the TSDCMP within UAV-enabled GMENs.

cs.NI

Energy-Sensitive Trajectory Design and Restoration Areas Allocation for UAV-Enabled Grassland Restoration

Grassland restoration is a critical means to safeguard grassland ecological degradation. To alleviate the extensive human labors and boost the restoration efficiency, UAV is promising for its fully automatic capability yet still waits to be exploited. This paper progresses this emerging technology by explicitly considering the realistic constraints of the UAV and the grassland degradation while planning the grassland restoration. To this end, the UAV-enabled restoration process is first mathematically modeled as the maximization of restoration areas of the UAV under the limited battery energy of UAV, the grass seeds weight, the number of restored areas, and the corresponding sizes. Then we analyze that, by considering these constraints, this original problem emerges two conflict objectives, namely the shortest flight path and the optimal areas allocation. As a result, the maximization of restoration areas turns out to be a composite of a trajectory design problem and an areas allocation problem that are highly coupled. From the perspective of optimization, this requires solving two NP-hard problems of both the traveling salesman problem (TSP) and the multidimensional knapsack problem (MKP) at the same time. To tackle this complex problem, we propose a cooperative optimization algorithm, called CHAPBILM, to solve those two problems interlacedly by utilizing the interdependencies between them. Multiple simulations verify the conflicts between the trajectory design and areas allocation. The effectiveness of the cooperative optimization algorithm is also supported by the comparisons with traditional optimization methods which do not utilize the interdependencies between the two problems. As a result, the proposed algorithm successfully solves the multiple simulation instances in a near-optimal way.

cs.NE