CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>   <script> var _paq = window._paq = window._paq || []; /* tracker methods like "setCustomDimension" should be called before "trackPageView" */ _paq.push(['trackPageView']); _paq.push(['enableLinkTracking']); (function() { var u="//matomo.waset.org/"; _paq.push(['setTrackerUrl', u+'matomo.php']); _paq.push(['setSiteId', '2']); var d=document, g=d.createElement('script'), s=d.getElementsByTagName('script')[0]; g.async=true; g.src=u+'matomo.js'; s.parentNode.insertBefore(g,s); })(); </script>  <title>Search results for: iterative dynamic programming</title> <meta name="description" content="Search results for: iterative dynamic programming"> <meta name="keywords" content="iterative dynamic programming"> <meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1, user-scalable=no"> <meta charset="utf-8"> <link href="https://cdn.waset.org/favicon.ico" type="image/x-icon" rel="shortcut icon"> <link href="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/css/bootstrap.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/plugins/fontawesome/css/all.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/css/site.css?v=150220211555" rel="stylesheet"> </head> <body> <header> <div class="container"> <nav class="navbar navbar-expand-lg navbar-light"> <a class="navbar-brand" href="https://waset.org"> <img src="https://cdn.waset.org/static/images/wasetc.png" alt="Open Science Research Excellence" title="Open Science Research Excellence" /> </a> <button class="d-block d-lg-none navbar-toggler ml-auto" type="button" data-toggle="collapse" data-target="#navbarMenu" aria-controls="navbarMenu" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="w-100"> <div class="d-none d-lg-flex flex-row-reverse"> <form method="get" action="https://waset.org/search" class="form-inline my-2 my-lg-0"> <input class="form-control mr-sm-2" type="search" placeholder="Search Conferences" value="iterative dynamic programming" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2025/2026/2027">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/abstracts/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="iterative dynamic programming"> <input type="submit" class="btn_search" value="Search"> </div> </div> </form> </div> </div> <div class="row mt-3"> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Commenced</strong> in January 2007</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Frequency:</strong> Monthly</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Edition:</strong> International</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Paper Count:</strong> 5184</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: iterative dynamic programming</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5184</span> Iterative Dynamic Programming for 4D Flight Trajectory Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kawser%20Ahmed">Kawser Ahmed</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20Bousson"> K. Bousson</a>, <a href="https://publications.waset.org/abstracts/search?q=Milca%20F.%20Coelho"> Milca F. Coelho</a> </p> <p class="card-text"><strong>Abstract:</strong></p> 4D flight trajectory optimization is one of the key ingredients to improve flight efficiency and to enhance the air traffic capacity in the current air traffic management (ATM). The present paper explores the iterative dynamic programming (IDP) as a potential numerical optimization method for 4D flight trajectory optimization. IDP is an iterative version of the Dynamic programming (DP) method. Due to the numerical framework, DP is very suitable to deal with nonlinear discrete dynamic systems. The 4D waypoint representation of the flight trajectory is similar to the discretization by a grid system; thus DP is a natural method to deal with the 4D flight trajectory optimization. However, the computational time and space complexity demanded by the DP is enormous due to the immense number of grid points required to find the optimum, which prevents the use of the DP in many practical high dimension problems. On the other hand, the IDP has shown potentials to deal successfully with high dimension optimal control problems even with a few numbers of grid points at each stage, which reduces the computational effort over the traditional DP approach. Although the IDP has been applied successfully in chemical engineering problems, IDP is yet to be validated in 4D flight trajectory optimization problems. In this paper, the IDP has been successfully used to generate minimum length 4D optimal trajectory avoiding any obstacle in its path, such as a no-fly zone or residential areas when flying in low altitude to reduce noise pollution. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=4D%20waypoint%20navigation" title="4D waypoint navigation">4D waypoint navigation</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20dynamic%20programming" title=" iterative dynamic programming"> iterative dynamic programming</a>, <a href="https://publications.waset.org/abstracts/search?q=obstacle%20avoidance" title=" obstacle avoidance"> obstacle avoidance</a>, <a href="https://publications.waset.org/abstracts/search?q=trajectory%20optimization" title=" trajectory optimization"> trajectory optimization</a> </p> <a href="https://publications.waset.org/abstracts/106496/iterative-dynamic-programming-for-4d-flight-trajectory-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/106496.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">172</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5183</span> A General Iterative Nonlinear Programming Method to Synthesize Heat Exchanger Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rupu%20Yang">Rupu Yang</a>, <a href="https://publications.waset.org/abstracts/search?q=Cong%20Toan%20Tran"> Cong Toan Tran</a>, <a href="https://publications.waset.org/abstracts/search?q=Assaad%20Zoughaib"> Assaad Zoughaib</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The work provides an iterative nonlinear programming method to synthesize a heat exchanger network by manipulating the trade-offs between the heat load of process heat exchangers (HEs) and utilities. We consider for the synthesis problem two cases, the first one without fixed cost for HEs, and the second one with fixed cost. For the no fixed cost problem, the nonlinear programming (NLP) model with all the potential HEs is optimized to obtain the global optimum. For the case with fixed cost, the NLP model is iterated through adding/removing HEs. The method was applied in five case studies and illustrated quite well effectiveness. Among which, the approach reaches the lowest TAC (2,904,026$/year) compared with the best record for the famous Aromatic plants problem. It also locates a slightly better design than records in literature for a 10 streams case without fixed cost with only 1/9 computational time. Moreover, compared to the traditional mixed-integer nonlinear programming approach, the iterative NLP method opens a possibility to consider constraints (such as controllability or dynamic performances) that require knowing the structure of the network to be calculated. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=heat%20exchanger%20network" title="heat exchanger network">heat exchanger network</a>, <a href="https://publications.waset.org/abstracts/search?q=synthesis" title=" synthesis"> synthesis</a>, <a href="https://publications.waset.org/abstracts/search?q=NLP" title=" NLP"> NLP</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a> </p> <a href="https://publications.waset.org/abstracts/138480/a-general-iterative-nonlinear-programming-method-to-synthesize-heat-exchanger-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/138480.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">170</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5182</span> Adaptive Optimal Controller for Uncertain Inverted Pendulum System: A Dynamic Programming Approach for Continuous Time System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dao%20Phuong%20Nam">Dao Phuong Nam</a>, <a href="https://publications.waset.org/abstracts/search?q=Tran%20Van%20Tuyen"> Tran Van Tuyen</a>, <a href="https://publications.waset.org/abstracts/search?q=Do%20Trong%20Tan"> Do Trong Tan</a>, <a href="https://publications.waset.org/abstracts/search?q=Bui%20Minh%20Dinh"> Bui Minh Dinh</a>, <a href="https://publications.waset.org/abstracts/search?q=Nguyen%20Van%20Huong"> Nguyen Van Huong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we investigate the adaptive optimal control law for continuous-time systems with input disturbances and unknown parameters. This paper extends previous works to obtain the robust control law of uncertain systems. Through theoretical analysis, an adaptive dynamic programming (ADP) based optimal control is proposed to stabilize the closed-loop system and ensure the convergence properties of proposed iterative algorithm. Moreover, the global asymptotic stability (GAS) for closed system is also analyzed. The theoretical analysis for continuous-time systems and simulation results demonstrate the performance of the proposed algorithm for an inverted pendulum system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=approximate%2Fadaptive%20dynamic%20programming" title="approximate/adaptive dynamic programming">approximate/adaptive dynamic programming</a>, <a href="https://publications.waset.org/abstracts/search?q=ADP" title=" ADP"> ADP</a>, <a href="https://publications.waset.org/abstracts/search?q=adaptive%20optimal%20control%20law" title=" adaptive optimal control law"> adaptive optimal control law</a>, <a href="https://publications.waset.org/abstracts/search?q=input%20state%20stability" title=" input state stability"> input state stability</a>, <a href="https://publications.waset.org/abstracts/search?q=ISS" title=" ISS"> ISS</a>, <a href="https://publications.waset.org/abstracts/search?q=inverted%20pendulum" title=" inverted pendulum"> inverted pendulum</a> </p> <a href="https://publications.waset.org/abstracts/80356/adaptive-optimal-controller-for-uncertain-inverted-pendulum-system-a-dynamic-programming-approach-for-continuous-time-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/80356.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">199</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5181</span> Approximating Fixed Points by a Two-Step Iterative Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Safeer%20Hussain%20Khan">Safeer Hussain Khan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we introduce a two-step iterative algorithm to prove a strong convergence result for approximating common fixed points of three contractive-like operators. Our algorithm basically generalizes an existing algorithm..Our iterative algorithm also contains two famous iterative algorithms: Mann iterative algorithm and Ishikawa iterative algorithm. Thus our result generalizes the corresponding results proved for the above three iterative algorithms to a class of more general operators. At the end, we remark that nothing prevents us to extend our result to the case of the iterative algorithm with error terms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=contractive-like%20operator" title="contractive-like operator">contractive-like operator</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20algorithm" title=" iterative algorithm"> iterative algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=fixed%20point" title=" fixed point"> fixed point</a>, <a href="https://publications.waset.org/abstracts/search?q=strong%20convergence" title=" strong convergence"> strong convergence</a> </p> <a href="https://publications.waset.org/abstracts/10341/approximating-fixed-points-by-a-two-step-iterative-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/10341.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">555</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5180</span> On Optimum Stratification</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20G.%20M.%20Khan">M. G. M. Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=V.%20D.%20Prasad"> V. D. Prasad</a>, <a href="https://publications.waset.org/abstracts/search?q=D.%20K.%20Rao"> D. K. Rao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this manuscript, we discuss the problem of determining the optimum stratification of a study (or main) variable based on the auxiliary variable that follows a uniform distribution. If the stratification of survey variable is made using the auxiliary variable it may lead to substantial gains in precision of the estimates. This problem is formulated as a Nonlinear Programming Problem (NLPP), which turn out to multistage decision problem and is solved using dynamic programming technique. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=auxiliary%20variable" title="auxiliary variable">auxiliary variable</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20programming%20technique" title=" dynamic programming technique"> dynamic programming technique</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20programming%20problem" title=" nonlinear programming problem"> nonlinear programming problem</a>, <a href="https://publications.waset.org/abstracts/search?q=optimum%20stratification" title=" optimum stratification"> optimum stratification</a>, <a href="https://publications.waset.org/abstracts/search?q=uniform%20distribution" title=" uniform distribution"> uniform distribution</a> </p> <a href="https://publications.waset.org/abstracts/6677/on-optimum-stratification" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/6677.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">339</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5179</span> Fixed Points of Contractive-Like Operators by a Faster Iterative Process</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Safeer%20Hussain%20Khan">Safeer Hussain Khan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we prove a strong convergence result using a recently introduced iterative process with contractive-like operators. This improves and generalizes corresponding results in the literature in two ways: the iterative process is faster, operators are more general. In the end, we indicate that the results can also be proved with the iterative process with error terms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=contractive-like%20operator" title="contractive-like operator">contractive-like operator</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20process" title=" iterative process"> iterative process</a>, <a href="https://publications.waset.org/abstracts/search?q=fixed%20point" title=" fixed point"> fixed point</a>, <a href="https://publications.waset.org/abstracts/search?q=strong%20convergence" title=" strong convergence"> strong convergence</a> </p> <a href="https://publications.waset.org/abstracts/3818/fixed-points-of-contractive-like-operators-by-a-faster-iterative-process" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3818.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">439</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5178</span> Optimum Strati铿乧ation of a Skewed Population</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=D.%20K.%20Rao">D. K. Rao</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20G.%20M.%20Khan"> M. G. M. Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20G.%20Reddy"> K. G. Reddy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The focus of this paper is to develop a technique of solving a combined problem of determining Optimum Strata Boundaries (OSB) and Optimum Sample Size (OSS) of each stratum, when the population understudy is skewed and the study variable has a Pareto frequency distribution. The problem of determining the OSB is formulated as a Mathematical Programming Problem (MPP) which is then solved by dynamic programming technique. A numerical example is presented to illustrate the computational details of the proposed method. The proposed technique is useful to obtain OSB and OSS for a Pareto type skewed population, which minimizes the variance of the estimate of population mean. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=strati%EF%AC%81ed%20sampling" title="strati铿乪d sampling">strati铿乪d sampling</a>, <a href="https://publications.waset.org/abstracts/search?q=optimum%20strata%20boundaries" title=" optimum strata boundaries"> optimum strata boundaries</a>, <a href="https://publications.waset.org/abstracts/search?q=optimum%20sample%20size" title=" optimum sample size"> optimum sample size</a>, <a href="https://publications.waset.org/abstracts/search?q=pareto%20distribution" title=" pareto distribution"> pareto distribution</a>, <a href="https://publications.waset.org/abstracts/search?q=mathematical%20programming%20problem" title=" mathematical programming problem"> mathematical programming problem</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20programming%20technique" title=" dynamic programming technique"> dynamic programming technique</a> </p> <a href="https://publications.waset.org/abstracts/5894/optimum-stratification-of-a-skewed-population" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/5894.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">460</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5177</span> A Three-Step Iterative Process for Common Fixed Points of Three Contractive-Like Operators</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Safeer%20Hussain%20Khan">Safeer Hussain Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=H.%20Fukhar-ud-Din"> H. Fukhar-ud-Din</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The concept of quasi-contractive type operators was given by Berinde and extended by Imoru and Olatinwo. They named this new type as contractive-like operators. On the other hand, Xu and Noo introduced a three-step-one-mappings iterative process which can be seen as a generalization of Mann and Ishikawa iterative processes. Approximating common fixed points has its own importance as it has a direct link with minimization problem. Motivated by this, in this paper, we first extend the iterative process of Xu and Noor to the case of three-step-three-mappings and then prove a strong convergence result using contractive-like operators for this iterative process. In general, this generalizes corresponding results using Mann, Ishikawa and Xu-Noor iterative processes with quasi-contractive type operators. It is to be pointed out that our results can also be proved with iterative process involving error terms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=contractive-like%20operator" title="contractive-like operator">contractive-like operator</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20process" title=" iterative process"> iterative process</a>, <a href="https://publications.waset.org/abstracts/search?q=common%20fixed%20point" title=" common fixed point"> common fixed point</a>, <a href="https://publications.waset.org/abstracts/search?q=strong%20convergence" title=" strong convergence"> strong convergence</a> </p> <a href="https://publications.waset.org/abstracts/15892/a-three-step-iterative-process-for-common-fixed-points-of-three-contractive-like-operators" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15892.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">597</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5176</span> Use the Null Space to Create Starting Point for Stochastic Programming</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ghussoun%20Al-Jeiroudi">Ghussoun Al-Jeiroudi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Stochastic programming is one of the powerful technique which is used to solve real-life problems. Hence, the data of real-life problems is subject to significant uncertainty. Uncertainty is well studied and modeled by stochastic programming. Each day, problems become bigger and bigger and the need for a tool, which does deal with large scale problems, increase. Interior point method is a perfect tool to solve such problems. Interior point method is widely employed to solve the programs, which arise from stochastic programming. It is an iterative technique, so it is required a starting point. Well design starting point plays an important role in improving the convergence speed. In this paper, we propose a starting point for interior point method for multistage stochastic programming. Usually, the optimal solution of stage k+1 is used as starting point for the stage k. This point has the advantage of being close to the solution of the current program. However, it has a disadvantage; it is not in the feasible region of the current program. So, we suggest to take this point and modifying it. That is by adding to it a vector in the null space of the matrix of the unchanged constraints because the solution will change only in the null space of this matrix. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=interior%20point%20methods" title="interior point methods">interior point methods</a>, <a href="https://publications.waset.org/abstracts/search?q=stochastic%20programming" title=" stochastic programming"> stochastic programming</a>, <a href="https://publications.waset.org/abstracts/search?q=null%20space" title=" null space"> null space</a>, <a href="https://publications.waset.org/abstracts/search?q=starting%20points" title=" starting points"> starting points</a> </p> <a href="https://publications.waset.org/abstracts/54185/use-the-null-space-to-create-starting-point-for-stochastic-programming" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/54185.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">424</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5175</span> Dynamic Economic Load Dispatch Using Quadratic Programming: Application to Algerian Electrical Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Graa">A. Graa</a>, <a href="https://publications.waset.org/abstracts/search?q=I.%20Ziane"> I. Ziane</a>, <a href="https://publications.waset.org/abstracts/search?q=F.%20Benhamida"> F. Benhamida</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Souag"> S. Souag</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a comparative analysis study of an efficient and reliable quadratic programming (QP) to solve economic load dispatch (ELD) problem with considering transmission losses in a power system. The proposed QP method takes care of different unit and system constraints to find optimal solution. To validate the effectiveness of the proposed QP solution, simulations have been performed using Algerian test system. Results obtained with the QP method have been compared with other existing relevant approaches available in literatures. Experimental results show a proficiency of the QP method over other existing techniques in terms of robustness and its optimal search. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=economic%20dispatch" title="economic dispatch">economic dispatch</a>, <a href="https://publications.waset.org/abstracts/search?q=quadratic%20programming" title=" quadratic programming"> quadratic programming</a>, <a href="https://publications.waset.org/abstracts/search?q=Algerian%20network" title=" Algerian network"> Algerian network</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20load" title=" dynamic load"> dynamic load</a> </p> <a href="https://publications.waset.org/abstracts/23032/dynamic-economic-load-dispatch-using-quadratic-programming-application-to-algerian-electrical-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/23032.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">569</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5174</span> Identifying Unknown Dynamic Forces Applied on Two Dimensional Frames</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=H.%20Katkhuda">H. Katkhuda</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A time domain approach is used in this paper to identify unknown dynamic forces applied on two dimensional frames using the measured dynamic structural responses for a sub-structure in the two dimensional frame. In this paper a sub-structure finite element model with short length of measurement from only three or four accelerometers is required, and an iterative least-square algorithm is used to identify the unknown dynamic force applied on the structure. Validity of the method is demonstrated with numerical examples using noise-free and noise-contaminated structural responses. Both harmonic and impulsive forces are studied. The results show that the proposed approach can identify unknown dynamic forces within very limited iterations with high accuracy and shows its robustness even noise- polluted dynamic response measurements are utilized. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dynamic%20force%20identification" title="dynamic force identification">dynamic force identification</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20responses" title=" dynamic responses"> dynamic responses</a>, <a href="https://publications.waset.org/abstracts/search?q=sub-structure" title=" sub-structure"> sub-structure</a>, <a href="https://publications.waset.org/abstracts/search?q=time%20domain" title=" time domain"> time domain</a> </p> <a href="https://publications.waset.org/abstracts/8992/identifying-unknown-dynamic-forces-applied-on-two-dimensional-frames" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/8992.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">366</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5173</span> Solving Linear Systems Involved in Convex Programming Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yixun%20Shi">Yixun Shi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Many interior point methods for convex programming solve an (n+m)x(n+m)linear system in each iteration. Many implementations solve this system in each iteration by considering an equivalent mXm system (4) as listed in the paper, and thus the job is reduced into solving the system (4). However, the system(4) has to be solved exactly since otherwise the error would be entirely passed onto the last m equations of the original system. Often the Cholesky factorization is computed to obtain the exact solution of (4). One Cholesky factorization is to be done in every iteration, resulting in higher computational costs. In this paper, two iterative methods for solving linear systems using vector division are combined together and embedded into interior point methods. Instead of computing one Cholesky factorization in each iteration, it requires only one Cholesky factorization in the entire procedure, thus significantly reduces the amount of computation needed for solving the problem. Based on that, a hybrid algorithm for solving convex programming problems is proposed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=convex%20programming" title="convex programming">convex programming</a>, <a href="https://publications.waset.org/abstracts/search?q=interior%20point%20method" title=" interior point method"> interior point method</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20systems" title=" linear systems"> linear systems</a>, <a href="https://publications.waset.org/abstracts/search?q=vector%20division" title=" vector division"> vector division</a> </p> <a href="https://publications.waset.org/abstracts/39573/solving-linear-systems-involved-in-convex-programming-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/39573.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">405</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5172</span> A Common Automated Programming Platform for Knowledge Based Software Engineering</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ivan%20Stanev">Ivan Stanev</a>, <a href="https://publications.waset.org/abstracts/search?q=Maria%20Koleva"> Maria Koleva</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A common platform for automated programming (CPAP) is defined in details. Two versions of CPAP are described: Cloud-based (including the set of components for classic programming, and the set of components for combined programming) and KBASE based (including the set of components for automated programming, and the set of components for ontology programming). Four KBASE products (module for automated programming of robots, intelligent product manual, intelligent document display, and intelligent form generator) are analyzed and CPAP contributions to automated programming are presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=automated%20programming" title="automated programming">automated programming</a>, <a href="https://publications.waset.org/abstracts/search?q=cloud%20computing" title=" cloud computing"> cloud computing</a>, <a href="https://publications.waset.org/abstracts/search?q=knowledge%20based%20software%20engineering" title=" knowledge based software engineering"> knowledge based software engineering</a>, <a href="https://publications.waset.org/abstracts/search?q=service%20oriented%20architecture" title=" service oriented architecture"> service oriented architecture</a> </p> <a href="https://publications.waset.org/abstracts/40829/a-common-automated-programming-platform-for-knowledge-based-software-engineering" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40829.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">350</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5171</span> Iterative Estimator-Based Nonlinear Backstepping Control of a Robotic Exoskeleton</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Brahmi%20Brahim">Brahmi Brahim</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Habibur%20Rahman"> Mohammad Habibur Rahman</a>, <a href="https://publications.waset.org/abstracts/search?q=Maarouf%20Saad"> Maarouf Saad</a>, <a href="https://publications.waset.org/abstracts/search?q=Crist%C3%B3bal%20Ochoa%20Luna"> Crist贸bal Ochoa Luna</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A repetitive training movement is an efficient method to improve the ability and movement performance of stroke survivors and help them to recover their lost motor function and acquire new skills. The ETS-MARSE is seven degrees of freedom (DOF) exoskeleton robot developed to be worn on the lateral side of the right upper-extremity to assist and rehabilitate the patients with upper-extremity dysfunction resulting from stroke. Practically, rehabilitation activities are repetitive tasks, which make the assistive/robotic systems to suffer from repetitive/periodic uncertainties and external perturbations induced by the high-order dynamic model (seven DOF) and interaction with human muscle which impact on the tracking performance and even on the stability of the exoskeleton. To ensure the robustness and the stability of the robot, a new nonlinear backstepping control was implemented with designed tests performed by healthy subjects. In order to limit and to reject the periodic/repetitive disturbances, an iterative estimator was integrated into the control of the system. The estimator does not need the precise dynamic model of the exoskeleton. Experimental results confirm the robustness and accuracy of the controller performance to deal with the external perturbation, and the effectiveness of the iterative estimator to reject the repetitive/periodic disturbances. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=backstepping%20control" title="backstepping control">backstepping control</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20control" title=" iterative control"> iterative control</a>, <a href="https://publications.waset.org/abstracts/search?q=Rehabilitation" title=" Rehabilitation"> Rehabilitation</a>, <a href="https://publications.waset.org/abstracts/search?q=ETS-MARSE" title=" ETS-MARSE"> ETS-MARSE</a> </p> <a href="https://publications.waset.org/abstracts/50768/iterative-estimator-based-nonlinear-backstepping-control-of-a-robotic-exoskeleton" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50768.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">290</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5170</span> A Survey of Grammar-Based Genetic Programming and Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Matthew%20T.%20Wilson">Matthew T. Wilson</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper covers a selection of research utilizing grammar-based genetic programming, and illustrates how context-free grammar can be used to constrain genetic programming. It focuses heavily on grammatical evolution, one of the most popular variants of grammar-based genetic programming, and the way its operators and terminals are specialized and modified from those in genetic programming. A variety of implementations of grammatical evolution for general use are covered, as well as research each focused on using grammatical evolution or grammar-based genetic programming on a single application, or to solve a specific problem, including some of the classically considered genetic programming problems, such as the Santa Fe Trail. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=context-free%20grammar" title="context-free grammar">context-free grammar</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithms" title=" genetic algorithms"> genetic algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20programming" title=" genetic programming"> genetic programming</a>, <a href="https://publications.waset.org/abstracts/search?q=grammatical%20evolution" title=" grammatical evolution"> grammatical evolution</a> </p> <a href="https://publications.waset.org/abstracts/120249/a-survey-of-grammar-based-genetic-programming-and-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/120249.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">195</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5169</span> Apply Commitment Method in Power System to Minimize the Fuel Cost</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Shaban">Mohamed Shaban</a>, <a href="https://publications.waset.org/abstracts/search?q=Adel%20Yahya"> Adel Yahya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The goal of this paper study is to schedule the power generation units to minimize fuel consumption cost based on a model that solves unit commitment problems. This can be done by utilizing forward dynamic programming method to determine the most economic scheduling of generating units. The model was applied to a power station, which consists of four generating units. The obtained results show that the applications of forward dynamic programming method offer a substantial reduction in fuel consumption cost. The fuel consumption cost has been reduced from $116,326 to $102,181 within a 24-hour period. This means saving about 12.16 % of fuel consumption cost. The study emphasizes the importance of applying modeling schedule programs to the operation of power generation units. As a consequence less consumption of fuel, less loss of power and less pollution <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=unit%20commitment" title="unit commitment">unit commitment</a>, <a href="https://publications.waset.org/abstracts/search?q=forward%20dynamic" title=" forward dynamic"> forward dynamic</a>, <a href="https://publications.waset.org/abstracts/search?q=fuel%20cost" title=" fuel cost"> fuel cost</a>, <a href="https://publications.waset.org/abstracts/search?q=programming" title=" programming"> programming</a>, <a href="https://publications.waset.org/abstracts/search?q=generation%20scheduling" title=" generation scheduling"> generation scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=operation%20cost" title=" operation cost"> operation cost</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20system" title=" power system"> power system</a>, <a href="https://publications.waset.org/abstracts/search?q=generating%20units" title=" generating units"> generating units</a> </p> <a href="https://publications.waset.org/abstracts/33870/apply-commitment-method-in-power-system-to-minimize-the-fuel-cost" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33870.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">620</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5168</span> Efficient Iterative V-BLAST Detection Technique in Wireless Communication System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hwan-Jun%20Choi">Hwan-Jun Choi</a>, <a href="https://publications.waset.org/abstracts/search?q=Sung-Bok%20Choi"> Sung-Bok Choi</a>, <a href="https://publications.waset.org/abstracts/search?q=Hyoung-Kyu%20Song"> Hyoung-Kyu Song</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recently, among the MIMO-OFDM detection techniques, a lot of papers suggested V-BLAST scheme which can achieve high data rate. Therefore, the signal detection of MIMOOFDM system is important issue. In this paper, efficient iterative VBLAST detection technique is proposed in wireless communication system. The proposed scheme adjusts the number of candidate symbol and iterative scheme based on channel state. According to the simulation result, the proposed scheme has better BER performance than conventional schemes and similar BER performance of the QRD-M with iterative scheme. Moreover complexity of proposed scheme has 50.6 % less than complexity of QRD-M detection with iterative scheme. Therefore the proposed detection scheme can be efficiently used in wireless communication. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=MIMO-OFDM" title="MIMO-OFDM">MIMO-OFDM</a>, <a href="https://publications.waset.org/abstracts/search?q=V-BLAST" title=" V-BLAST"> V-BLAST</a>, <a href="https://publications.waset.org/abstracts/search?q=QR-decomposition" title=" QR-decomposition"> QR-decomposition</a>, <a href="https://publications.waset.org/abstracts/search?q=QRDM" title=" QRDM"> QRDM</a>, <a href="https://publications.waset.org/abstracts/search?q=DFE" title=" DFE"> DFE</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20scheme" title=" iterative scheme"> iterative scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=channel%20condition" title=" channel condition"> channel condition</a> </p> <a href="https://publications.waset.org/abstracts/3522/efficient-iterative-v-blast-detection-technique-in-wireless-communication-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3522.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">535</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5167</span> Cutting Plane Methods for Integer Programming: NAZ Cut and Its Variations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Bari">A. Bari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Integer programming is a branch of mathematical programming techniques in operations research in which some or all of the variables are required to be integer valued. Various cuts have been used to solve these problems. We have also developed cuts known as NAZ cut & A-T cut to solve the integer programming problems. These cuts are used to reduce the feasible region and then reaching the optimal solution in minimum number of steps. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Integer%20Programming" title="Integer Programming">Integer Programming</a>, <a href="https://publications.waset.org/abstracts/search?q=NAZ%20cut" title=" NAZ cut"> NAZ cut</a>, <a href="https://publications.waset.org/abstracts/search?q=A-T%20cut" title=" A-T cut"> A-T cut</a>, <a href="https://publications.waset.org/abstracts/search?q=Cutting%20plane%20method" title=" Cutting plane method"> Cutting plane method</a> </p> <a href="https://publications.waset.org/abstracts/8763/cutting-plane-methods-for-integer-programming-naz-cut-and-its-variations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/8763.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">369</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5166</span> Optimization of Agricultural Water Demand Using a Hybrid Model of Dynamic Programming and Neural Networks: A Case Study of Algeria</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Boudjerda">M. Boudjerda</a>, <a href="https://publications.waset.org/abstracts/search?q=B.%20Touaibia"> B. Touaibia</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20K.%20Mihoubi"> M. K. Mihoubi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In Algeria agricultural irrigation is the primary water consuming sector followed by the domestic and industrial sectors. Economic development in the last decade has weighed heavily on water resources which are relatively limited and gradually decreasing to the detriment of agriculture. The research presented in this paper focuses on the optimization of irrigation water demand. Dynamic Programming-Neural Network (DPNN) method is applied to investigate reservoir optimization. The optimal operation rule is formulated to minimize the gap between water release and water irrigation demand. As a case study, Foum El-Gherza dam’s reservoir system in south of Algeria has been selected to examine our proposed optimization model. The application of DPNN method allowed increasing the satisfaction rate (SR) from 12.32% to 55%. In addition, the operation rule generated showed more reliable and resilience operation for the examined case study. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=water%20management" title="water management">water management</a>, <a href="https://publications.waset.org/abstracts/search?q=agricultural%20demand" title=" agricultural demand"> agricultural demand</a>, <a href="https://publications.waset.org/abstracts/search?q=dam%20and%20reservoir%20operation" title=" dam and reservoir operation"> dam and reservoir operation</a>, <a href="https://publications.waset.org/abstracts/search?q=Foum%20el-Gherza%20dam" title=" Foum el-Gherza dam"> Foum el-Gherza dam</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20programming" title=" dynamic programming"> dynamic programming</a>, <a href="https://publications.waset.org/abstracts/search?q=artificial%20neural%20network" title=" artificial neural network"> artificial neural network</a> </p> <a href="https://publications.waset.org/abstracts/117003/optimization-of-agricultural-water-demand-using-a-hybrid-model-of-dynamic-programming-and-neural-networks-a-case-study-of-algeria" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/117003.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">120</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5165</span> Parameter Estimation of False Dynamic EIV Model with Additive Uncertainty</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dalvinder%20Kaur%20Mangal">Dalvinder Kaur Mangal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> For the past decade, noise corrupted output measurements have been a fundamental research problem to be investigated. On the other hand, the estimation of the parameters for linear dynamic systems when also the input is affected by noise is recognized as more difficult problem which only recently has received increasing attention. Representations where errors or measurement noises/disturbances are present on both the inputs and outputs are usually called errors-in-variables (EIV) models. These disturbances may also have additive effects which are also considered in this paper. Parameter estimation of false EIV problem using equation error, output error and iterative prefiltering identification schemes with and without additive uncertainty, when only the output observation is corrupted by noise has been dealt in this paper. The comparative study of these three schemes has also been carried out. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=errors-in-variable%20%28EIV%29" title="errors-in-variable (EIV)">errors-in-variable (EIV)</a>, <a href="https://publications.waset.org/abstracts/search?q=false%20EIV" title=" false EIV"> false EIV</a>, <a href="https://publications.waset.org/abstracts/search?q=equation%20error" title=" equation error"> equation error</a>, <a href="https://publications.waset.org/abstracts/search?q=output%20error" title=" output error"> output error</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20prefiltering" title=" iterative prefiltering"> iterative prefiltering</a>, <a href="https://publications.waset.org/abstracts/search?q=Gaussian%20noise" title=" Gaussian noise"> Gaussian noise</a> </p> <a href="https://publications.waset.org/abstracts/9427/parameter-estimation-of-false-dynamic-eiv-model-with-additive-uncertainty" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9427.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">502</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5164</span> Examining Relationship between Programming Performance, Programming Self Efficacy and Math Success </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mustafa%20Ekici">Mustafa Ekici</a>, <a href="https://publications.waset.org/abstracts/search?q=Sacide%20G%C3%BCzin%20Mazman"> Sacide G眉zin Mazman </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Programming is the one of ability in computer science fields which is generally perceived difficult by students and various individual differences have been implicated in that ability success. Although several factors that affect programming ability have been identified over the years, there is not still a full understanding of why some students learn to program easily and quickly while others find it complex and difficult. Programming self-efficacy and mathematic success are two of those essential individual differences which are handled as having important effect on the programming success. This study aimed to identify the relationship between programming performance, programming self efficacy and mathematics success. The study group is consisted of 96 undergraduates from Department of Econometrics of U艧ak University. 38 (39,58%) of the participants are female while 58 (60,41%) of them are male. Study was conducted in the programming-I course during 2014-2015 fall term. Data collection tools are comprised of programming course final grades, programming self efficacy scale and a mathematics achievement test. Data was analyzed through correlation analysis. The result of study will be reported in the full text of the study. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=programming%20performance" title="programming performance">programming performance</a>, <a href="https://publications.waset.org/abstracts/search?q=self%20efficacy" title=" self efficacy"> self efficacy</a>, <a href="https://publications.waset.org/abstracts/search?q=mathematic%20success" title=" mathematic success"> mathematic success</a>, <a href="https://publications.waset.org/abstracts/search?q=computer%20science" title=" computer science"> computer science</a> </p> <a href="https://publications.waset.org/abstracts/18162/examining-relationship-between-programming-performance-programming-self-efficacy-and-math-success" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/18162.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">508</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5163</span> Dynamic Store Procedures in Database</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Muhammet%20Dursun%20Kaya">Muhammet Dursun Kaya</a>, <a href="https://publications.waset.org/abstracts/search?q=Hasan%20Asil"> Hasan Asil</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In recent years, different methods have been proposed to optimize question processing in database. Although different methods have been proposed to optimize the query, but the problem which exists here is that most of these methods destroy the query execution plan after executing the query. This research attempts to solve the above problem by using a combination of methods of communicating with the database (the present questions in the programming code and using store procedures) and making query processing adaptive in database, and proposing a new approach for optimization of query processing by introducing the idea of dynamic store procedures. This research creates dynamic store procedures in the database according to the proposed algorithm. This method has been tested on applied software and results shows a significant improvement in reducing the query processing time and also reducing the workload of DBMS. Other advantages of this algorithm include: making the programming environment a single environment, eliminating the parametric limitations of the stored procedures in the database, making the stored procedures in the database dynamic, etc. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=relational%20database" title="relational database">relational database</a>, <a href="https://publications.waset.org/abstracts/search?q=agent" title=" agent"> agent</a>, <a href="https://publications.waset.org/abstracts/search?q=query%20processing" title=" query processing"> query processing</a>, <a href="https://publications.waset.org/abstracts/search?q=adaptable" title=" adaptable"> adaptable</a>, <a href="https://publications.waset.org/abstracts/search?q=communication%20with%20the%20database" title=" communication with the database"> communication with the database</a> </p> <a href="https://publications.waset.org/abstracts/35023/dynamic-store-procedures-in-database" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35023.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">377</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5162</span> Application of De Novo Programming Approach for Optimizing the Business Process</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Z.%20Babic">Z. Babic</a>, <a href="https://publications.waset.org/abstracts/search?q=I.%20Veza"> I. Veza</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Balic"> A. Balic</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Crnjac"> M. Crnjac</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The linear programming model is sometimes difficult to apply in real business situations due to its assumption of proportionality. This paper shows an example of how to use De Novo programming approach instead of linear programming. In the De Novo programming, resources are not fixed like in linear programming but resource quantities depend only on available budget. Budget is a new, important element of the De Novo approach. Two different production situations are presented: increasing costs and quantity discounts of raw materials. The focus of this paper is on advantages of the De Novo approach in the optimization of production plan for production company which produces souvenirs made from famous stone from the island of Brac, one of the greatest islands from Croatia. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=business%20process" title="business process">business process</a>, <a href="https://publications.waset.org/abstracts/search?q=De%20Novo%20programming" title=" De Novo programming"> De Novo programming</a>, <a href="https://publications.waset.org/abstracts/search?q=optimizing" title=" optimizing"> optimizing</a>, <a href="https://publications.waset.org/abstracts/search?q=production" title=" production"> production</a> </p> <a href="https://publications.waset.org/abstracts/80556/application-of-de-novo-programming-approach-for-optimizing-the-business-process" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/80556.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">228</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5161</span> Optimal Trajectory Finding of IDP Ventilation Control with Outdoor Air Information and Indoor Health Risk Index</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Minjeong%20Kim">Minjeong Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Seungchul%20Lee"> Seungchul Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Iman%20Janghorban%20Esfahani"> Iman Janghorban Esfahani</a>, <a href="https://publications.waset.org/abstracts/search?q=Jeong%20Tai%20Kim"> Jeong Tai Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=ChangKyoo%20Yoo"> ChangKyoo Yoo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A trajectory of set-point of ventilation control systems plays an important role for efficient ventilation inside subway stations since it affects the level of indoor air pollutants and ventilation energy consumption. To maintain indoor air quality (IAQ) at a comfortable range with lower ventilation energy consumption, the optimal trajectory of the ventilation control system needs to be determined. The concentration of air pollutants inside the station shows a diurnal variation in accordance with the variations in the number of passengers and subway frequency. To consider the diurnal variation of IAQ, an iterative dynamic programming (IDP) that searches for a piecewise control policy by separating whole duration into several stages is used. When outdoor air is contaminated by pollutants, it enters the subway station through the ventilation system, which results in the deteriorated IAQ and adverse effects on passenger health. In this study, to consider the influence of outdoor air quality (OAQ), a new performance index of the IDP with the passenger health risk and OAQ is proposed. This study was carried out for an underground subway station at Seoul Metro, Korea. The optimal set-points of the ventilation control system are determined every 3 hours, then, the ventilation controller adjusts the ventilation fan speed according to the optimal set-point changes. Compared to manual ventilation system which is operated irrespective of the OAQ, the IDP-based ventilation control system saves 3.7% of the energy consumption. Compared to the fixed set-point controller which is operated irrespective of the IAQ diurnal variation, the IDP-based controller shows better performance with a 2% decrease in energy consumption, maintaining the comfortable IAQ range inside the station. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=indoor%20air%20quality" title="indoor air quality">indoor air quality</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20dynamic%20algorithm" title=" iterative dynamic algorithm"> iterative dynamic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=outdoor%20air%20information" title=" outdoor air information"> outdoor air information</a>, <a href="https://publications.waset.org/abstracts/search?q=ventilation%20control%20system" title=" ventilation control system"> ventilation control system</a> </p> <a href="https://publications.waset.org/abstracts/26099/optimal-trajectory-finding-of-idp-ventilation-control-with-outdoor-air-information-and-indoor-health-risk-index" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/26099.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">503</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5160</span> A Fuzzy Programming Approach for Solving Intuitionistic Fuzzy Linear Fractional Programming Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sujeet%20Kumar%20Singh">Sujeet Kumar Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=Shiv%20Prasad%20Yadav"> Shiv Prasad Yadav</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper develops an approach for solving intuitionistic fuzzy linear fractional programming (IFLFP) problem where the cost of the objective function, the resources, and the technological coefficients are triangular intuitionistic fuzzy numbers. Here, the IFLFP problem is transformed into an equivalent crisp multi-objective linear fractional programming (MOLFP) problem. By using fuzzy mathematical programming approach the transformed MOLFP problem is reduced into a single objective linear programming (LP) problem. The proposed procedure is illustrated through a numerical example. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=triangular%20intuitionistic%20fuzzy%20number" title="triangular intuitionistic fuzzy number">triangular intuitionistic fuzzy number</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20programming%20problem" title=" linear programming problem"> linear programming problem</a>, <a href="https://publications.waset.org/abstracts/search?q=multi%20objective%20linear%20programming%20problem" title=" multi objective linear programming problem"> multi objective linear programming problem</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20mathematical%20programming" title=" fuzzy mathematical programming"> fuzzy mathematical programming</a>, <a href="https://publications.waset.org/abstracts/search?q=membership%20function" title=" membership function"> membership function</a> </p> <a href="https://publications.waset.org/abstracts/16411/a-fuzzy-programming-approach-for-solving-intuitionistic-fuzzy-linear-fractional-programming-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/16411.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">573</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5159</span> Software Transactional Memory in a Dynamic Programming Language at Virtual Machine Level</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Szu-Kai%20Hsu">Szu-Kai Hsu</a>, <a href="https://publications.waset.org/abstracts/search?q=Po-Ching%20Lin"> Po-Ching Lin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> As more and more multi-core processors emerge, traditional sequential programming paradigm no longer suffice. Yet only few modern dynamic programming languages can leverage such advantage. Ruby, for example, despite its wide adoption, only includes threads as a simple parallel primitive. The global virtual machine lock of official Ruby runtime makes it impossible to exploit full parallelism. Though various alternative Ruby implementations do eliminate the global virtual machine lock, they only provide developers dated locking mechanism for data synchronization. However, traditional locking mechanism error-prone by nature. Software Transactional Memory is one of the promising alternatives among others. This paper introduces a new virtual machine: GobiesVM to provide a native software transactional memory based solution for dynamic programming languages to exploit parallelism. We also proposed a simplified variation of Transactional Locking II algorithm. The empirical results of our experiments show that support of STM at virtual machine level enables developers to write straightforward code without compromising parallelism or sacrificing thread safety. Existing source code only requires minimal or even none modi cation, which allows developers to easily switch their legacy codebase to a parallel environment. The performance evaluations of GobiesVM also indicate the difference between sequential and parallel execution is significant. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=global%20interpreter%20lock" title="global interpreter lock">global interpreter lock</a>, <a href="https://publications.waset.org/abstracts/search?q=ruby" title=" ruby"> ruby</a>, <a href="https://publications.waset.org/abstracts/search?q=software%20transactional%20memory" title=" software transactional memory"> software transactional memory</a>, <a href="https://publications.waset.org/abstracts/search?q=virtual%20machine" title=" virtual machine"> virtual machine</a> </p> <a href="https://publications.waset.org/abstracts/17152/software-transactional-memory-in-a-dynamic-programming-language-at-virtual-machine-level" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/17152.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">291</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5158</span> Sensitivity Analysis in Fuzzy Linear Programming Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20H.%20Nasseri">S. H. Nasseri</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Ebrahimnejad"> A. Ebrahimnejad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Fuzzy set theory has been applied to many fields, such as operations research, control theory, and management sciences. In this paper, we consider two classes of fuzzy linear programming (FLP) problems: Fuzzy number linear programming and linear programming with trapezoidal fuzzy variables problems. We state our recently established results and develop fuzzy primal simplex algorithms for solving these problems. Finally, we give illustrative examples. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20linear%20programming" title="fuzzy linear programming">fuzzy linear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20numbers" title=" fuzzy numbers"> fuzzy numbers</a>, <a href="https://publications.waset.org/abstracts/search?q=duality" title=" duality"> duality</a>, <a href="https://publications.waset.org/abstracts/search?q=sensitivity%20analysis" title=" sensitivity analysis"> sensitivity analysis</a> </p> <a href="https://publications.waset.org/abstracts/16916/sensitivity-analysis-in-fuzzy-linear-programming-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/16916.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">571</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5157</span> Implementation of Iterative Algorithm for Earthquake Location</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hussain%20K.%20Chaiel">Hussain K. Chaiel</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The development in the field of the digital signal processing (DSP) and the microelectronics technology reduces the complexity of the iterative algorithms that need large number of arithmetic operations. Virtex-Field Programmable Gate Arrays (FPGAs) are programmable silicon foundations which offer an important solution for addressing the needs of high performance DSP designer. In this work, Virtex-7 FPGA technology is used to implement an iterative algorithm to estimate the earthquake location. Simulation results show that an implementation based on block RAMB36E1 and DSP48E1 slices of Virtex-7 type reduces the number of cycles of the clock frequency. This enables the algorithm to be used for earthquake prediction. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=DSP" title="DSP">DSP</a>, <a href="https://publications.waset.org/abstracts/search?q=earthquake" title=" earthquake"> earthquake</a>, <a href="https://publications.waset.org/abstracts/search?q=FPGA" title=" FPGA"> FPGA</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20algorithm" title=" iterative algorithm "> iterative algorithm </a> </p> <a href="https://publications.waset.org/abstracts/28897/implementation-of-iterative-algorithm-for-earthquake-location" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/28897.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">396</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5156</span> An Iterative Family for Solution of System of Nonlinear Equations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sonia%20Sonia">Sonia Sonia</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a family of iterative scheme for solving nonlinear systems of equations which have wide application in sciences and engineering. The proposed iterative family is based upon some parameters which generates many different iterative schemes. This family is completely derivative free and uses first of divided difference operator. Moreover some numerical experiments are performed and compared with existing methods. Analysis of convergence shows that the presented family has fourth-order of convergence. The dynamical behaviour of proposed family and local convergence have also been discussed. The numerical performance and convergence region comparison demonstrates that proposed family is efficient. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=convergence" title="convergence">convergence</a>, <a href="https://publications.waset.org/abstracts/search?q=divided%20difference%20operator" title=" divided difference operator"> divided difference operator</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20system" title=" nonlinear system"> nonlinear system</a>, <a href="https://publications.waset.org/abstracts/search?q=Newton%27s%20method" title=" Newton's method"> Newton's method</a> </p> <a href="https://publications.waset.org/abstracts/80719/an-iterative-family-for-solution-of-system-of-nonlinear-equations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/80719.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">241</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5155</span> Iterative Linear Quadratic Regulator (iLQR) vs LQR Controllers for Quadrotor Path Tracking</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wesam%20Jasim">Wesam Jasim</a>, <a href="https://publications.waset.org/abstracts/search?q=Dongbing%20Gu"> Dongbing Gu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents an iterative linear quadratic regulator optimal control technique to solve the problem of quadrotors path tracking. The dynamic motion equations are represented based on unit quaternion representation and include some modelled aerodynamical effects as a nonlinear part. Simulation results prove the ability and effectiveness of iLQR to stabilize the quadrotor and successfully track different paths. It also shows that iLQR controller outperforms LQR controller in terms of fast convergence and tracking errors. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=iLQR%20controller" title="iLQR controller">iLQR controller</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20control" title=" optimal control"> optimal control</a>, <a href="https://publications.waset.org/abstracts/search?q=path%20tracking" title=" path tracking"> path tracking</a>, <a href="https://publications.waset.org/abstracts/search?q=quadrotor%20UAVs" title=" quadrotor UAVs"> quadrotor UAVs</a> </p> <a href="https://publications.waset.org/abstracts/51436/iterative-linear-quadratic-regulator-ilqr-vs-lqr-controllers-for-quadrotor-path-tracking" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/51436.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">460</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=iterative%20dynamic%20programming&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=iterative%20dynamic%20programming&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=iterative%20dynamic%20programming&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=iterative%20dynamic%20programming&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=iterative%20dynamic%20programming&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=iterative%20dynamic%20programming&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=iterative%20dynamic%20programming&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=iterative%20dynamic%20programming&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=iterative%20dynamic%20programming&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=iterative%20dynamic%20programming&page=172">172</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=iterative%20dynamic%20programming&page=173">173</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=iterative%20dynamic%20programming&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2025 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>