In this paper we propose a modification of the clustering based nonlinear state–space projection (CNPF) method. The whole filtering process takes place in a reconstructed state–space by applying the time–delay embe...
详细信息
In the context of DOORS, a medium-scale distributed system, running on tens of 'normal PCs and/or embedded devices, we propose a solution for the problem of efficient allocation of execution and storage resources....
详细信息
The amount of data generated daily grows tremendously in virtually all domains of science and industry, and its efficient storage, processing and analysis pose significant practical challenges nowadays. To automate th...
详细信息
In the contemporary retail sector, deciphering customer behavior is crucial for businesses vying for a competitive advantage. While customer loyalty has conventionally been gauged through parameters such as repeat pur...
详细信息
Nowadays medical equipment makes possible performing tests by patients themselves. These tests are usually health parameter measurements, like a glucose level or blood pressure. Though they are rather regularly perfor...
详细信息
The occurrence of intraoperative hypertension/ hypotension may cause danger to a patient. Therefore, the monitoring of blood pressure change during surgical operation is momentous for anesthetized patient undergoing s...
详细信息
Policy Optimization (PO) algorithms have been proven particularly suited to handle the high-dimensionality of real-world continuous control tasks. In this context, Trust Region Policy Optimization methods represent a ...
ISBN:
(纸本)9781713871088
Policy Optimization (PO) algorithms have been proven particularly suited to handle the high-dimensionality of real-world continuous control tasks. In this context, Trust Region Policy Optimization methods represent a popular approach to stabilize the policy updates. These usually rely on the Kullback-Leibler (KL) divergence to limit the change in the policy. The Wasserstein distance represents a natural alternative, in place of the KL divergence, to define trust regions or to regularize the objective function. However, state-of-the-art works either resort to its approximations or do not provide an algorithm for continuous state-action spaces, reducing the applicability of the method. In this paper, we explore optimal transport discrepancies (which include the Wasserstein distance) to define trust regions, and we propose a novel algorithm - Optimal Transport Trust Region Policy Optimization (OT-TRPO) - for continuous state-action spaces. We circumvent the infinite-dimensional optimization problem for PO by providing a one-dimensional dual reformulation for which strong duality holds. We then analytically derive the optimal policy update given the solution of the dual problem. This way, we bypass the computation of optimal transport costs and of optimal transport maps, which we implicitly characterize by solving the dual formulation. Finally, we provide an experimental evaluation of our approach across various control tasks. Our results show that optimal transport discrepancies can offer an advantage over state-of-the-art approaches.
Timely pest detection and identification is critical as part of modern agriculture. Halyomorpha Halys is a prevalent pest with proven harmful impacts on numerous crops and agricultural regions. The paper proposes an e...
Timely pest detection and identification is critical as part of modern agriculture. Halyomorpha Halys is a prevalent pest with proven harmful impacts on numerous crops and agricultural regions. The paper proposes an efficient model to improve the detection of two invasive stink bugs: Halyomorpha halys and Nezara Viridula. automatic detection of these two bugs is essential in various fields, such as precision agriculture and integrated pest management. The high performances obtained in the present study open new perspectives for the further development of insect pest detection systems and can serve as a basis for future modifications and improvements of these models.
Given their flexibility and encouraging performance, deep-learning models are becoming standard for motion prediction in autonomous driving. However, with great flexibility comes a lack of interpretability and possibl...
Given their flexibility and encouraging performance, deep-learning models are becoming standard for motion prediction in autonomous driving. However, with great flexibility comes a lack of interpretability and possible violations of physical constraints. Accompanying these data-driven methods with differentially-constrained motion models to provide physically feasible trajectories is a promising future direction. The foundation for this work is a previously introduced graph-neural-network-based model, MTP-GO. The neural network learns to compute the inputs to an underlying motion model to provide physically feasible trajectories. This research investigates the performance of various motion models in combination with numerical solvers for the prediction task. The study shows that simpler models, such as low-order integrator models, are preferred over more complex, e.g., kinematic models, to achieve accurate predictions. Further, the numerical solver can have a substantial impact on performance, advising against commonly used first-order methods like Euler forward. Instead, a second-order method like Heun’s can greatly improve predictions.
Enabling resilient autonomous motion planning requires robust predictions of surrounding road users' future behavior. In response to this need and the associated challenges, we introduce our model titled MTP-GO. T...
详细信息
暂无评论