相关论文: Evading the model sign problem in the PNJL model w…

In this paper, we address the numerical solution of the Optimal Transport Problem on undirected weighted graphs, taking the shortest path distance as transport cost. The optimal solution is obtained from the long-time limit of the gradient…

This paper introduces a local planner that synergizes the decision making and trajectory planning modules towards autonomous driving. The decision making and trajectory planning tasks are jointly formulated as a nonlinear programming…

Complex systems are usually modelled through a combination of structural and behavioural models, where separate behavioural models make it easier to design and understand partial behaviour. When partial models are combined, we need to…

Motion planning can be cast as a trajectory optimisation problem where a cost is minimised as a function of the trajectory being generated. In complex environments with several obstacles and complicated geometry, this optimisation problem…

The sign problem in quantum Monte Carlo calculations is analyzed using the meron-cluster solution. The concept of merons can be used to solve the sign problem for a limited class of models. Here we show that the method can be used to…

Lattice QCD has the sign problem at real quark chemical potential. There are some regions with no sign problem; one is the imaginary quark chemical potential region and the others are the real and imaginary isospin chemical potential…

Machine Learning models incorporating multiple layered learning networks have been seen to provide effective models for various classification problems. The resulting optimization problem to solve for the optimal vector minimizing the…

We consider a nonlinear system, affine with respect to an unbounded control $u$ which is allowed to range in a closed cone. To this system we associate a Bolza type minimum problem, with a Lagrangian having sublinear growth with respect to…

Effects of a flavor singlet vector interaction in the Polyakov - Nambu - Jona-Lasinio (PNJL) model are studied in combination with the axial U(1) breaking Kobayashi - Maskawa - 't Hooft interaction. Using a consistent cutoff scheme we…

Signature, lying at the heart of rough path theory, is a central tool for analysing controlled differential equations driven by irregular paths. Recently it has also found extensive applications in machine learning and data science as a…

We consider the problem of optimal path planning on a manifold which is the image of a smooth function. Optimal path-planning is of crucial importance for motion planning, image processing, and statistical data analysis. In this work, we…

The Linear Assignment Problem (LAP) is a fundamental combinatorial optimization task with applications ranging from computer vision to logistics. Classical exact solvers such as the Hungarian and Jonker-Volgenant (LAPJV) algorithms…

This paper is concerned with adaptive signal control problems on a road network, using a link-based kinematic wave model (Han et al., 2012). Such a model employs the Lighthill-Whitham-Richards model with a triangular fundamental diagram. A…

This paper presents a framework to tackle combinatorial optimization problems using neural networks and reinforcement learning. We focus on the traveling salesman problem (TSP) and train a recurrent network that, given a set of city…

Closed-loop optimal control design for high-dimensional nonlinear systems has been a long-standing challenge. Traditional methods, such as solving the associated Hamilton-Jacobi-Bellman equation, suffer from the curse of dimensionality.…

Coordinating agents through hazardous environments, such as aid-delivering drones navigating conflict zones or field robots traversing deployment areas filled with obstacles, poses fundamental planning challenges. We introduce and analyze…

Interdiction problems are leader-follower games in which the leader is allowed to delete a certain number of edges from the graph in order to maximally impede the follower, who is trying to solve an optimization problem on the impeded…

We study the classical Node-Disjoint Paths (NDP) problem: given an $n$-vertex graph $G$ and a collection $M=\{(s_1,t_1),\ldots,(s_k,t_k)\}$ of pairs of vertices of $G$ called demand pairs, find a maximum-cardinality set of node-disjoint…

We present a general technique for addressing sign problems that arise in Monte Carlo simulations of field theories. This method deforms the domain of the path integral to a manifold in complex field space that maximizes the average sign…

This paper presents the first study of the complexity of the optimization problem for integer linear-exponential programs which extend classical integer linear programs with the exponential function $x \mapsto 2^x$ and the remainder…