中文
相关论文

相关论文: Learning to Plan Chemical Syntheses

200 篇论文

We consider how to generate chemical reaction networks (CRNs) from functional specifications. We propose a two-stage approach that combines synthesis by satisfiability modulo theories and Markov chain Monte Carlo based optimisation. First,…

新兴技术 · 计算机科学 2015-08-19 Neil Dalchau , Niall Murphy , Rasmus Petersen , Boyan Yordanov

Monte-Carlo Tree Search (MCTS) is a family of sampling-based search algorithms widely used for online planning in sequential decision-making domains and at the heart of many recent advances in artificial intelligence. Understanding the…

人工智能 · 计算机科学 2025-09-25 Yiyu Qian , Tim Miller , Zheng Qian , Liyuan Zhao

Recently, stepwise supervision on Chain of Thoughts (CoTs) presents an enhancement on the logical reasoning tasks such as coding and math, with the help of Monte Carlo Tree Search (MCTS). However, its contribution to tasks requiring…

人工智能 · 计算机科学 2025-04-15 Chengyuan Liu , Shihang Wang , Lizhi Qing , Kaisong Song , Junjie Cao , Jun Lin , Ji Zhang , Ang Li , Kun Kuang , Fei Wu

A significant challenge in wet lab experiments with current drug design generative models is the trade-off between pharmacological properties and synthesizability. Molecules predicted to have highly desirable properties are often difficult…

机器学习 · 计算机科学 2025-04-04 Songtao Liu , Dandan Zhang , Zhengkai Tu , Hanjun Dai , Peng Liu

The ability of a robot to plan complex behaviors with real-time computation, rather than adhering to predesigned or offline-learned routines, alleviates the need for specialized algorithms or training for each problem instance. Monte Carlo…

机器人学 · 计算机科学 2024-12-17 Benjamin Riviere , John Lathrop , Soon-Jo Chung

Online planning is crucial for high performance in many complex sequential decision-making tasks. Monte Carlo Tree Search (MCTS) employs a principled mechanism for trading off exploration for exploitation for efficient online planning, and…

人工智能 · 计算机科学 2024-02-08 Kalle Kujanpää , Amin Babadi , Yi Zhao , Juho Kannala , Alexander Ilin , Joni Pajarinen

Monte Carlo Tree Search (MCTS)-based algorithms, such as MuZero and its derivatives, have achieved widespread success in various decision-making domains. These algorithms employ the reanalyze process to enhance sample efficiency from stale…

人工智能 · 计算机科学 2025-01-03 Chunyu Xuan , Yazhe Niu , Yuan Pu , Shuai Hu , Yu Liu , Jing Yang

Non-monotone object rearrangement planning in confined spaces such as cabinets and shelves is a widely occurring but challenging problem in robotics. Both the robot motion and the available regions for object relocation are highly…

机器人学 · 计算机科学 2024-08-09 Hanwen Ren , Ahmed H. Qureshi

Global climate challenge is demanding urgent actions for decarbonization, while electric power systems take the major roles in clean energy transition. Due to the existence of spatially and temporally dispersed renewable energy resources…

系统与控制 · 电气工程与系统科学 2024-08-13 Xuan He , Danny H. K. Tsang , Yize Chen

Retrieving target objects from unknown, confined spaces remains a challenging task that requires integrated, task-driven active sensing and rearrangement planning. Previous approaches have independently addressed active sensing and…

机器人学 · 计算机科学 2024-11-19 Junyong Kim , Hanwen Ren , Ahmed H. Qureshi

State of the art methods for robotic path planning in dynamic environments, such as crowds or traffic, rely on hand crafted motion models for agents. These models often do not reflect interactions of agents in real world scenarios. To…

机器人学 · 计算机科学 2020-02-03 Stuart Eiffert , He Kong , Navid Pirmarzdashti , Salah Sukkarieh

Online motion planning is a challenging problem for intelligent robots moving in dense environments with dynamic obstacles, e.g., crowds. In this work, we propose a novel approach for optimal and safe online motion planning with minimal…

人工智能 · 计算机科学 2025-01-17 Lorenzo Bonanni , Daniele Meli , Alberto Castellini , Alessandro Farinelli

Monte-Carlo Tree Search (MCTS) is a fundamental sampling-based search algorithm widely used for online planning in sequential decision-making domains. Despite its success in driving recent advances in artificial intelligence, understanding…

人工智能 · 计算机科学 2026-04-17 Yiyu Qian , Liyuan Zhao , Tim Miller

For UAV-aided wireless systems, online path planning attracts much attention recently. To better adapt to the real-time dynamic environment, we, for the first time, propose a Monte Carlo Tree Search (MCTS)-based path planning scheme. In…

网络与互联网体系结构 · 计算机科学 2022-02-08 Yuwen Qian , Kexin Sheng , Chuan Ma , Jun Li , Ming Ding , Mahbub Hassan

Reaction and retrosynthesis prediction are fundamental tasks in computational chemistry that have recently garnered attention from both the machine learning and drug discovery communities. Various deep learning approaches have been proposed…

机器学习 · 计算机科学 2023-06-29 Ziqiao Meng , Peilin Zhao , Yang Yu , Irwin King

Mobile robots hold great promise in reducing the need for humans to perform jobs such as vacuuming, seeding,harvesting, painting, search and rescue, and inspection. In practice, these tasks must often be done without an exact map of the…

多智能体系统 · 计算机科学 2020-02-12 Phillip Hyatt , Zachary Brock , Marc D. Killpack

Monte Carlo Tree Search (MCTS) has been proposed as a transformative approach to join-order optimization in database query processing, with recent frameworks such as AlphaJoin and HyperQO claiming to outperform traditional methods. However,…

The discovery of functional molecules is an expensive and time-consuming process, exemplified by the rising costs of small molecule therapeutic discovery. One class of techniques of growing interest for early-stage drug discovery is de novo…

定量方法 · 定量生物学 2020-02-18 Wenhao Gao , Connor W. Coley

Synthesis prediction is a key accelerator for the rapid design of advanced materials. However, determining synthesis variables such as the choice of precursor materials is challenging for inorganic materials because the sequence of…

材料科学 · 物理学 2023-06-13 Tanjin He , Haoyan Huo , Christopher J. Bartel , Zheren Wang , Kevin Cruse , Gerbrand Ceder

Generative Flow Networks (GFlowNets) treat sampling from distributions over compositional discrete spaces as a sequential decision-making problem, training a stochastic policy to construct objects step by step. Recent studies have revealed…

机器学习 · 计算机科学 2024-06-21 Nikita Morozov , Daniil Tiapkin , Sergey Samsonov , Alexey Naumov , Dmitry Vetrov