arXiv subjects

Bao Liu

Publications and source records attributed to Bao Liu.

7 recordsLinked to original sources

arXiv2026

ProcureGym: A Multi-Agent Markov Game Framework for Modeling National Volume-based Drug Procurement

In this paper, we introduce ProcureGym, an data-driven multi-agent simulation platform that models China's National Volume-Based drug Procurement (NVBP) as a Markov Game. Based on real-world data from 7 rounds of NVBP (covering 325 drugs and 2,267 firms), the platform establishes a high-fidelity simulation environment. Within this framework, we evaluate diverse agent models, including Reinforcement Learning (RL), Large Language Model (LLM), and Rule-based algorithms. Experimental results demonstrate that RL agents achieve superior winner alignment and profits. Further analyses show that maximum valid bidding price and procurement volume dominate strategic outcomes. ProcureGym thus serves as a rigorous instrument for assessing policy impacts and formulating future procurement strategies.

cs.SI↗

arXiv2025

End-to-End Generation of City-Scale Vectorized Maps by Crowdsourced Vehicles

High-precision vectorized maps are indispensable for autonomous driving, yet traditional LiDAR-based creation is costly and slow, while single-vehicle perception methods lack accuracy and robustness, particularly in adverse conditions. This paper introduces EGC-VMAP, an end-to-end framework that overcomes these limitations by generating accurate, city-scale vectorized maps through the aggregation of data from crowdsourced vehicles. Unlike prior approaches, EGC-VMAP directly fuses multi-vehicle, multi-temporal map elements perceived onboard vehicles using a novel Trip-Aware Transformer architecture within a unified learning process. Combined with hierarchical matching for efficient training and a multi-objective loss, our method significantly enhances map accuracy and structural robustness compared to single-vehicle baselines. Validated on a large-scale, multi-city real-world dataset, EGC-VMAP demonstrates superior performance, enabling a scalable, cost-effective solution for city-wide mapping with a reported 90\% reduction in manual annotation costs.

cs.RO↗

arXiv2024

Dynamic Multi-Objective Lion Swarm Optimization with Multi-strategy Fusion: An application in 6R robot trajectory planning

The advancement of industrialization has spurred the development of innovative swarm intelligence algorithms, with Lion Swarm Optimization (LSO) notable for its robustness, parallelism, simplicity, and efficiency. While LSO excels in single-objective optimization, its multi-objective variants face challenges such as poor initialization, local optima entrapment, and so on. This study proposes Dynamic Multi-Objective Lion Swarm Optimization with Multi-strategy Fusion (MF-DMOLSO) to address these limitations. MF-DMOLSO comprises three key components: initialization, swarm position update, and external archive update. The initialization unit employs chaotic mapping for uniform population distribution. The position update unit enhances behavior patterns and step size formulas for cub lions, incorporating crowding degree sorting, Pareto non-dominated sorting, and Levy flight to improve convergence speed and global search capabilities. Reference points guide convergence in higher-dimensional spaces, maintaining population diversity. An adaptive cold-hot start strategy generates a population responsive to environmental changes. The external archive update unit re-evaluates solutions based on non-domination and diversity to form the new population. Evaluations on benchmark functions showed MF-DMOLSO surpassed multi-objective particle swarm optimization, non-dominated sorting genetic algorithm II, and multi-objective lion swarm optimization, exceeding 90% accuracy for two-objective and 97% for three-objective problems. Compared to non-dominated sorting genetic algorithm III, MF-DMOLSO showed a 60% improvement. Applied to 6R robot trajectory planning, MF-DMOLSO optimized running time and maximum acceleration to 8.3s and 0.3pi rad/s^2, achieving a set coverage rate of 70.97% compared to 2% by multi-objective particle swarm optimization, thus improving efficiency and reducing mechanical dither.

cs.RO↗

arXiv2015

Strongly polarizing weakly coupled $^{13}$C nuclear spins with optically pumped nitrogen-vacancy center

Enhancing the polarization of nuclear spins surrounding the nitrogen-vacancy (NV) center in diamond has attracted widespread attention recently due to its various applications. Here we present an analytical theory and comprehensive understanding on how to optimize the dynamic nuclear polarization by an optically pumped NV center near the ground state level anticrossing. Our results not only provide a parameter-free explanation and a clearly physics picture for the recently observed polarization dependence on the magnetic field for strongly coupled $^{13}$C nuclei [H. J. Wang \textit{et al}., Nat. Commun. 4, 1 (2013)], but also demonstrate the possibility to strongly polarize weakly coupled $^{13}$C nuclei under weak optical pumping and suitably chosen magnetic field. This allows sensitive magnetic control of the $^{13}$C nuclear spin polarization for NMR applications and significant suppression of the $^{13}$C nuclear spin noise to prolong the NV spin coherence time.

quant-ph↗

arXiv2014

All-optical routing of single photons with multiple input and output ports by interferences

We propose a waveguide-cavity coupled system to achieve the routing of photons by the phases of other photons. Our router has four input ports and four output ports. The transport of the coherent-state photons injected through any input port can be controlled by the phases of the coherent-state photons injected through other input ports. This control can be achieved when the mean numbers of the routed and control photons are small enough and require no additional control fields. Therefore, the all-optical routing of photons can be achieved at the single-photon level.

quant-ph↗

arXiv2014

New criterion of asymptotic stability for delay systems with time-varying structures and delays

In this paper, we study asymptotic stability of the zero solution of a class of differential systems governed by a scalar differential inequality with time-varying structures and delays. We establish a new generalized Halanay inequality for the asymptotic stability of the zero solution for such systems under more relaxed conditions than the existing ones. We also apply the theoretical results to the analysis of self synchronization in networks of delayed differential systems and obtained a more general sufficient condition for self synchronization.

math.CA↗

arXiv2011

The crossing number of locally twisted cubes

The {\it crossing number} of a graph $G$ is the minimum number of pairwise intersections of edges in a drawing of $G$. Motivated by the recent work [Faria, L., Figueiredo, C.M.H. de, Sykora, O., Vrt'o, I.: An improved upper bound on the crossing number of the hypercube. J. Graph Theory {\bf 59}, 145--161 (2008)] which solves the upper bound conjecture on the crossing number of $n$-dimensional hypercube proposed by Erdős and Guy, we give upper and lower bounds of the crossing number of locally twisted cube, which is one of variants of hypercube.

math.CO↗