نتایج جستجو برای: optimization algorithmis iteratively run since a pre

تعداد نتایج: 13597129  

Journal: :international journal of robotics 0
abdolreza gharahsofloo faculty of mechanical engineering, sahid rajaee teacher training university, tehran, iran, p.o. box , 16785-136 ali rahmani hanzaki faculty of mechanical engineering, sahid rajaee teacher training university, tehran, iran, p.o. box , 16785-136

dimensional synthesis of a parallel robot may be the initial stage of its design process, which is usually carried out based on a required workspace. since optimization of the links lengths of the robot for the workspace is usually done, the workspace computation process must be run numerous times. hence, importance of the efficiency of the algorithm and the cpu time of the workspace computatio...

2014
Tetsuro Morimura Einoshin Suzuki Tsuyoshi Idé

where Sij represents α−2 Vij . In this section, we mainly discuss the optimization of Eq. (2). Since both W and Z are regarded as variables, we can not give closed-form solutions. However, Eq. (2) can be iteratively optimized with respect to Z by fixing W, and vice versa. By doing so, a local optimal can be reached since the value of Eq. (2) decreases or stays steadily even after a small number...

Mostafa E. Salehi Roham Shakiba,

In this paper we introduce an improvement in the path planning algorithm for the humanoid soccer playing robot which uses Ferguson splines and PSO (Particle Swarm Optimization). The objective of the algorithm is to find a path through other playing robots to the ball, which should be as short as possible and also safe enough. Ferguson splines create preliminary paths using random generated para...

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد تهران مرکزی - دانشکده زبانهای خارجی 1391

the present study has tried to accomplish an analysis of margaret atwood’s novels oryx and crake, and the year of the flood in the light of posthuman and cyborg theories. considering posthumanism as a critical reading of some notions of humanism focus of which in this thesis has been identity, new definitions for humanity and human identity are formed. haraway’s cyborg, as one possible new figu...

2018
Ivaylo B Mihaylov Eric A Mellon Raphael Yechieli Lorraine Portelance

PURPOSE Inverse planning is trial-and-error iterative process. This work introduces a fully automated inverse optimization approach, where the treatment plan is closely tailored to the unique patient anatomy. The auto-optimization is applied to pancreatic stereotactic body radiotherapy (SBRT). MATERIALS AND METHODS The automation is based on stepwise reduction of dose-volume histograms (DVHs)...

C.R. Suribabu, R. Deepika,

The shape optimization of gravity dam is posed as an optimization problem with goals of minimum value of concrete, stresses and maximum safety against overturning and sliding need to be achieved. Optimally designed structure generally saves large investments especially for a large structure. The size of hydraulic structures is usually huge and thus requires a huge investment. If the optimizatio...

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد تهران مرکزی - دانشکده زبانهای خارجی 1392

the extent to which written corrective feedback on linguistic errors can play a role in helping l2 writers improve the accuracy of their writing continues to be an issue of interest to researchers and teachers since truscott (1996) mounted a case for its abolition. while there is growing empirical evidence that written corrective feedback can successfully target some types of linguistic error (...

Abstract : There are several methods to cover the costs of a transmission system and distribution networks. These methods are divided into either incremental or marginal approaches, which can be either long-term or short-term. The main difference between the incremental and marginal approach is how to calculate the cost of using the network. In the incremental approach, simulation and in the ma...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه بوعلی سینا - دانشکده علوم پایه 1391

abstract: in this thesis, we focus to class of convex optimization problem whose objective function is given as a linear function and a convex function of a linear transformation of the decision variables and whose feasible region is a polytope. we show that there exists an optimal solution to this class of problems on a face of the constraint polytope of feasible region. based on this, we dev...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید