نتایج جستجو برای: dynamic key path discovery algorithm
تعداد نتایج: 1794713 فیلتر نتایج به سال:
In terms of mobile robot path planning, the traditional A* algorithm has following problems: a long searching time, an excessive number redundant nodes, and too many path-turning points. As result, shortest obtained from planning may not be optimal movement route actual robots, it will accelerate hardware loss robots. To address aforementioned problems, fusion for combining improved with segmen...
This paper describes the contributions of the SoftLearn platform to key issues in learning analytics, as i) discovery of the learning path that students follow in a course and ii) provide interpretability of graphs in dashboards
This paper proposes a new method for online secondary path modeling in feedback active noise control (ANC) systems. In practical cases, the secondary path is usually time-varying. For these cases, online modeling of secondary path is required to ensure convergence of the system. In literature the secondary path estimation is usually performed offline, prior to online modeling, where in the prop...
We present a modification of the Real-Time Dynamic Programming (rtdp) algorithm that makes it a genuine off-line algorithm for solving Stochastic Shortest-Path problems. Also, a new domainindependent and admissible heuristic is presented for Stochastic Shortest-Path problems. The new algorithm and heuristic are compared with Value Iteration over benchmark problems with large state spaces. The r...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید