SearcharxivSearch

arXiv subjects

Chengzhang Wang

Publications and source records attributed to Chengzhang Wang.

3 recordsLinked to original sources

GenMRP: A Generative Multi-Route Planning Framework for Efficient and Personalized Real-Time Industrial Navigation

Existing industrial-scale navigation applications contend with massive road networks, typically employing two main categories of approaches for route planning. The first relies on precomputed road costs for optimal routing and heuristic algorithms for generating alternatives, while the second, generative methods, has recently gained significant attention. However, the former struggles with personalization and route diversity, while the latter fails to meet the efficiency requirements of large-scale real-time scenarios. To address these limitations, we propose GenMRP, a generative framework for multi-route planning. To ensure generation efficiency, GenMRP first introduces a skeleton-to-capillary approach that dynamically constructs a relevant sub-network significantly smaller than the full road network. Within this sub-network, routes are generated iteratively. The first iteration identifies the optimal route, while the subsequent ones generate alternatives that balance quality and diversity using the newly proposed correctional boosting approach. Each iteration incorporates road features, user historical sequences, and previously generated routes into a Link Cost Model to update road costs, followed by route generation using the Dijkstra algorithm. Extensive experiments show that GenMRP achieves state-of-the-art performance with high efficiency in both offline and online environments. To facilitate further research, we have publicly released the training and evaluation dataset. GenMRP has been fully deployed in a real-world navigation app, demonstrating its effectiveness and benefits.

cs.RO

Towards Full Candidate Interaction: A Comprehensive Comparison Network for Better Route Recommendation

We argue that the decision-making essence of route recommendation is comparative judgment: users choose a route because it is better than alternatives in specific aspects. The decision-critical information resides in segment-level spatial differences of non-overlapping parts between routes, which is irreversibly lost through item-level feature aggregation. Existing methods, whether attention-based or pairwise ranking approaches, follow an item-first paradigm that can only infer pairwise relations indirectly from individual route representations. To address this, we propose the Comprehensive Comparison Network (CCN), which inverts the information flow by constructing explicit comparison features from non-overlapping segments between route pairs and reasoning directly in the pairwise space. CCN introduces a Comprehensive Comparison Block that enables context-aware pairwise reasoning, where the comparison between two routes is informed by how both compare against all other candidates. We further develop an interpretable Pair Scoring Network that decomposes pairwise preferences into independent physical fields, providing field-level explanations for route selection. CCN has served as the production ranking model in Amap for over two years, achieving 85.70% offline route-trajectory coverage rate and +1.2% online improvement over the previous production model. We also release a large-scale route recommendation dataset comprising 175 million users, 512 million samples, and 6 billion routes across 370 cities.

cs.IR

Automatic parametrization of implicit solvent models for the blind prediction of solvation free energies

In this work, a systematic protocol is proposed to automatically parametrize implicit solvent models with polar and nonpolar components. The proposed protocol utilizes the classical Poisson model or the Kohn-Sham density functional theory (KSDFT) based polarizable Poisson model for modeling polar solvation free energies. For the nonpolar component, either the standard model of surface area, molecular volume, and van der Waals interactions, or a model with atomic surface areas and molecular volume is employed. Based on the assumption that similar molecules have similar parametrizations, we develop scoring and ranking algorithms to classify solute molecules. Four sets of radius parameters are combined with four sets of charge force fields to arrive at a total of 16 different parametrizations for the Poisson model. A large database with 668 experimental data is utilized to validate the proposed protocol. The lowest leave-one-out root mean square (RMS) error for the database is 1.33k cal/mol. Additionally, five subsets of the database, i.e., SAMPL0-SAMPL4, are employed to further demonstrate that the proposed protocol offers some of the best solvation predictions. The optimal RMS errors are 0.93, 2.82, 1.90, 0.78, and 1.03 kcal/mol, respectively for SAMPL0, SAMPL1, SAMPL2, SAMPL3, and SAMPL4 test sets. These results are some of the best, to our best knowledge.

physics.chem-ph