Zobrazeno 1 - 10
of 48 950
pro vyhledávání: '"An Duo"'
Autor:
Xu, Duo, Fekri, Faramarz
In this work, we study the problem of learning generalizable policies for compositional tasks given by a logic specification. These tasks are composed by temporally extended subgoals. Due to dependencies of subgoals and long task horizon, previous re
Externí odkaz:
http://arxiv.org/abs/2410.09686
Designing a network (e.g., a telecommunication or transport network) is mainly done offline, in a planning phase, prior to the operation of the network. On the other hand, a massive effort has been devoted to characterizing dynamic networks, i.e., th
Externí odkaz:
http://arxiv.org/abs/2410.08875
Designing Public Transport (PT) networks able to satisfy mobility needs of people is essential to reduce the number of individual vehicles on the road, and thus pollution and congestion. Urban sustainability is thus tightly coupled to an efficient PT
Externí odkaz:
http://arxiv.org/abs/2410.08841
Accurately measuring magnetic field strength in the interstellar medium, including giant molecular clouds (GMCs), remains a significant challenge. We present a machine learning approach using Denoising Diffusion Probabilistic Models (DDPMs) to estima
Externí odkaz:
http://arxiv.org/abs/2410.07032
Microperforated panels (MPPs) display excellent capacity in noise control applications owing to their high strength, simple design, and efficacy in low-frequency sound absorption. Traditionally, the development of MPPs has relied on a trial-and-error
Externí odkaz:
http://arxiv.org/abs/2410.05635
One of the fundamental challenges in reinforcement learning (RL) is to take a complex task and be able to decompose it to subtasks that are simpler for the RL agent to learn. In this paper, we report on our work that would identify subtasks by using
Externí odkaz:
http://arxiv.org/abs/2410.01929
Living fish may suddenly encounter upstream obstacles, join the queue of the fish schooling, or detect upstream flow in advance, resulting in interactions with environmental vortices that can be abrupt or develop gradually from an initial state. The
Externí odkaz:
http://arxiv.org/abs/2409.17957
This paper considers learning online (implicit) nonlinear model predictive control (MPC) laws using neural networks and Laguerre functions. Firstly, we parameterize the control sequence of nonlinear MPC using Laguerre functions, which typically yield
Externí odkaz:
http://arxiv.org/abs/2409.09436
Shortest-path roadmaps, also known as reduced visibility graphs, provides a highly efficient multi-query method for computing optimal paths in two-dimensional environments. Combined with Minkowski sum computations, shortest-path roadmaps can compute
Externí odkaz:
http://arxiv.org/abs/2409.03920
We show that there exist only constant morphisms from $\mathbb{Q}^{2n+1}(n\geq 1)$ to $\mathbb{G}(l,2n+1)$ if $l$ is even $(0
Externí odkaz:
http://arxiv.org/abs/2409.02365