<p style='text-indent:20px;'>This manuscript discusses planning problems for first- and second-order one-dimensional mean-field games (MFGs). These are comprised of a Hamilton–Jacobi equation coupled with Fokker–Planck equation. Applying Poincaré's Lemma to the equation, we deduce existence potential. Rewriting in terms potential, obtain system Euler–Lagrange equations certain variational...

This work describes an approach that automatically extracts standard metadata information from e-learning contents, combines it with the student preferences/goals and creates PDDL planning domains+problems. These PDDL problems can be solved by current planners, although we motivate the use and benefits of case-based planning techniques, to obtain fully tailored learning routes that significantl...

In this paper, we introduce a new heuristic search algorithm based on mean values for real-time planning, called MHSP. It consists in associating the principles of UCT, a banditbased algorithm which gave very good results in computer games, and especially in Computer Go, with heuristic search in order to obtain a real-time planner in the context of classical planning. MHSP is evaluated on diffe...

Mean fields games describe the asymptotic behavior of differential games in which the number of players tends to +∞. Here we consider a numerical method for the optimal planning problem, i.e. the problem in which the positions of a very large number of identical rational agents, with common value function, evolve from a given initial spatial density to a desired target density at the final hori...

background: inclusion of inhomogeneity corrections in intensity modulated small fields always makes conformal irradiation of lung tumor very complicated in accurate dose delivery. objective: in the present study, the performance of five algorithms via monte carlo, pencil beam, convolution, fast superposition and superposition were evaluated in lung cancer intensity modulated radiotherapy planni...