Loading...
Search for: planning-problem
0.014 seconds
Total 25 records

    Covering Orthogonal Art Galleries with Sliding k-transmitters

    , Ph.D. Dissertation Sharif University of Technology Mahdavi, Salma Sadat (Author) ; Ghodsi, Mohammad (Supervisor)
    Abstract
    The problem of guarding orthogonal art galleries with sliding cameras is a special case of the well-known art gallery problem when the goal is to minimize the number of guards. Each guard is considered as a point, which can guard all points that are in its visibility area. In the sliding camera model, each guard is specified by an orthogonal line segment which is completely inside the polygon. The visibility area of each sliding camera is defined by its line segment.Inspired by advancements in wireless technologies and the need to offer wireless ser- vices to clients, a new variant of the problems for covering the regions has been studied. In this problem, a guard is modeled as an... 

    Scenario-based probabilistic multi-stage optimization for transmission expansion planning incorporating wind generation integration

    , Article Electric Power Systems Research ; Volume 189 , 2020 Taherkhani, M ; Hosseini, S. H ; Javadi, M. S ; Catalão, J. P. S ; Sharif University of Technology
    Elsevier Ltd  2020
    Abstract
    Integrated transmission expansion planning (TEP) and generation expansion planning (GEP) with Wind Farms (WFs) is addressed in this paper. The optimal number of expanded lines, the optimal capacity of WFs installed capacity, and the optimal capacity of wind farms lines (WFLs) are determined through a new TEP optimization model. Furthermore, the optimum capacity additions including conventional generating units is obtained in the proposed model. The Benders decomposition approach is used for solving the optimization problem, including a master problem and two sub-problems with internal scenario analysis. In order to reduce the computational burden of the multi-year and multi-objective... 

    Path planning for a hyper-redundant manipulator with lockable joints using PSO

    , Article International Conference on Robotics and Mechatronics, ICRoM 2013 ; 2013 , pp. 224-229 ; ISBN: 9781467358118 Taherifar, A ; Alasty, A ; Salarieh, H ; Boroushaki, M ; Sharif University of Technology
    Abstract
    In this paper, the path planning problem of special hyper-redundant manipulator with lockable joints is solved using particle swarm optimization. There is a locking mechanism in each link of this tendon-actuated manipulator. At any time, all links of the manipulator must be locked except one. Then by pulling the cables, the configuration of the corresponding link will change and the manipulator will tilt to its new position. Therefore, by unlocking the links in sequence and pulling the cables, any desirable configuration of manipulator can be reached. In path planning problem, the desired path of the end-effector is given and the optimum sequence of switching (discrete) and the optimum... 

    Path planning for a hyper-redundant manipulator with lockable joints using PSO

    , Article International Conference on Robotics and Mechatronics, ICRoM 2013 ; Feb , 2013 , Pages 224-229 ; 9781467358118 (ISBN) Taherifar, A ; Alasty, A ; Salarieh, H ; Boroushaki, M ; Sharif University of Technology
    2013
    Abstract
    In this paper, the path planning problem of special hyper-redundant manipulator with lockable joints is solved using particle swarm optimization. There is a locking mechanism in each link of this tendon-actuated manipulator. At any time, all links of the manipulator must be locked except one. Then by pulling the cables, the configuration of the corresponding link will change and the manipulator will tilt to its new position. Therefore, by unlocking the links in sequence and pulling the cables, any desirable configuration of manipulator can be reached. In path planning problem, the desired path of the end-effector is given and the optimum sequence of switching (discrete) and the optimum... 

    Hybrid immune-genetic algorithm method for benefit maximisation of distribution network operators and distributed generation owners in a deregulated environment

    , Article IET Generation, Transmission and Distribution ; Volume 5, Issue 9 , 2011 , Pages 961-972 ; 17518687 (ISSN) Soroudi, A ; Ehsan, M ; Caire, R ; Hadjsaid, N ; Sharif University of Technology
    Abstract
    In deregulated power systems, distribution network operators (DNO) are responsible for maintaining the proper operation and efficiency of distribution networks. This is achieved traditionally through specific investments in network components. The event of distributed generation (DG) has introduced new challenges to these distribution networks. The role of DG units must be correctly assessed to optimise the overall operating and investment cost for the whole system. However, the distributed generation owners (DGOs) have different objective functions which might be contrary to the objectives of DNO. This study presents a long-term dynamic multi-objective model for planning of distribution... 

    A practical eco-environmental distribution network planning model including fuel cells and non-renewable distributed energy resources

    , Article Renewable Energy ; Volume 36, Issue 1 , 2011 , Pages 179-188 ; 09601481 (ISSN) Soroudi, A ; Ehsan, M ; Zareipour, H ; Sharif University of Technology
    Abstract
    This paper presents a long-term dynamic multi-objective planning model for distribution network expansion along with distributed energy options. The proposed model optimizes two objectives, namely costs and emissions and determines the optimal schemes of sizing, placement and specially the dynamics (i.e., timing) of investments on distributed generation units and network reinforcements over the planning period. An efficient two-stage heuristic method is proposed to solve the formulated planning problem. The effectiveness of the proposed model is demonstrated by applying it to a distribution network and comparing the simulation results with other methods and models  

    The energy hub: An extensive survey on the state-of-the-art

    , Article Applied Thermal Engineering ; Volume 161 , 2019 ; 13594311 (ISSN) Sadeghi, H ; Rashidinejad, M ; Moeini Aghtaie, M ; Abdollahi, A ; Sharif University of Technology
    Elsevier Ltd  2019
    Abstract
    Today's world energy-related challenges, ranging from anthropogenic climate change to continuous growth of demand for different energy forms, have enforced planners of energy systems (ESs) to concentrate on more optimal and eco-friendly operation and/or expansion planning methodologies. In this context, increased interdependencies of gas, heat and electricity ESs have recently encouraged the planners to design operation and/or expiation strategies in an integrated manner in favor of a new concept, the so-called “Energy Hub” (EH). Although this concept has been employed so far in a multitude of studies, but its real nature, advantages, difficulties, importance or inevitability aspect, and... 

    Singularity-free planning for a robot cat free-fall with control delay: role of limbs and tail

    , Article 2017 8th International Conference on Mechanical and Aerospace Engineering, ICMAE 2017, 22 July 2017 through 25 July 2017 ; 2017 , Pages 215-221 ; 9781538633052 (ISBN) Sadati, S. M. H ; Meghdari, A ; Sharif University of Technology
    Abstract
    Cat free fall righting maneuverer has inspired many aerial, space and legged robotic research. Conservation of angular momentum principle is used to derive the inverse differential kinematic and TMT vector form dynamics of the motion for three robotic models: a two-link model, a three-link model with tail, and a comprehensive eight-link model with the addition of legs. The path planning problem in the presence of geometric and kinematic constraints is addressed using a novel singularity free single shooting optimization method. While a 2 DOF torso is sufficient to perform a full maneuver, the addition of the tail reduces the time and increases the maneuverability despite the leg motions that... 

    A complete state-space based temporal planner

    , Article Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI, 7 November 2011 through 9 November 2011, Boca Raton, FL ; 2011 , Pages 297-304 ; 10823409 (ISSN) ; 9780769545967 (ISBN) Rankooh, M. F ; Ghassem Sani, G ; Sharif University of Technology
    Abstract
    Since that heuristic state space planners have been very successful in classical planning, this approach is currently the most popular strategy in dealing with temporal planning, too. However, all current state-space temporal planners use a search method known as decision epoch planning, which is not complete for problems with required concurrency. In theory, this flaw can be overcome by employing another search method, called temporally lifted progression planning. In this paper, we show that there are two major problems which, if not tackled properly, can cause the latter method to be very inefficient in practice. The first problem is dealing with the remarkably large state space of... 

    Optimizing decentralized production–distribution planning problem in a multi-period supply chain network under uncertainty

    , Article Journal of Industrial Engineering International ; 2017 , Pages 1-16 ; 17355702 (ISSN) Nourifar, R ; Mahdavi, I ; Mahdavi Amiri, N ; Paydar, M. M ; Sharif University of Technology
    Abstract
    Decentralized supply chain management is found to be significantly relevant in today’s competitive markets. Production and distribution planning is posed as an important optimization problem in supply chain networks. Here, we propose a multi-period decentralized supply chain network model with uncertainty. The imprecision related to uncertain parameters like demand and price of the final product is appropriated with stochastic and fuzzy numbers. We provide mathematical formulation of the problem as a bi-level mixed integer linear programming model. Due to problem’s convolution, a structure to solve is developed that incorporates a novel heuristic algorithm based on Kth-best algorithm, fuzzy... 

    Optimizing decentralized production–distribution planning problem in a multi-period supply chain network under uncertainty

    , Article Journal of Industrial Engineering International ; Volume 14, Issue 2 , 2018 , Pages 367-382 ; 17355702 (ISSN) Nourifar, R ; Mahdavi, I ; Mahdavi Amiri, N ; Paydar, M. M ; Sharif University of Technology
    SpringerOpen  2018
    Abstract
    Decentralized supply chain management is found to be significantly relevant in today’s competitive markets. Production and distribution planning is posed as an important optimization problem in supply chain networks. Here, we propose a multi-period decentralized supply chain network model with uncertainty. The imprecision related to uncertain parameters like demand and price of the final product is appropriated with stochastic and fuzzy numbers. We provide mathematical formulation of the problem as a bi-level mixed integer linear programming model. Due to problem’s convolution, a structure to solve is developed that incorporates a novel heuristic algorithm based on Kth-best algorithm, fuzzy... 

    A new motion planning method for discretely actuated hyper-redundant manipulators

    , Article Robotica ; February , 2015 ; 02635747 (ISSN) Motahari, A ; Zohoor, H ; Habibnejad Korayem, M ; Sharif University of Technology
    Cambridge University Press  2015
    Abstract
    A hyper-redundant manipulator is made by mounting the serial and/or parallel mechanisms on top of each other as modules. In discrete actuation, the actuation amounts are a limited number of certain values. It is not feasible to solve the kinematic analysis problems of discretely actuated hyper-redundant manipulators (DAHMs) by using the common methods, which are used for continuous actuated manipulators. In this paper, a new method is proposed to solve the trajectory tracking problem in a static prescribed obstacle field. To date, this problem has not been considered in the literature. The removing first collision (RFC) method, which is originally proposed for solving the inverse kinematic... 

    A new motion planning method for discretely actuated hyper-redundant manipulators

    , Article Robotica ; Volume 35, Issue 1 , 2017 , Pages 101-118 ; 02635747 (ISSN) Motahari, A ; Zohoor, H ; Habibnejad Korayem, M ; Sharif University of Technology
    Cambridge University Press  2017
    Abstract
    A hyper-redundant manipulator is made by mounting the serial and/or parallel mechanisms on top of each other as modules. In discrete actuation, the actuation amounts are a limited number of certain values. It is not feasible to solve the kinematic analysis problems of discretely actuated hyper-redundant manipulators (DAHMs) by using the common methods, which are used for continuous actuated manipulators. In this paper, a new method is proposed to solve the trajectory tracking problem in a static prescribed obstacle field. To date, this problem has not been considered in the literature. The removing first collision (RFC) method, which is originally proposed for solving the inverse kinematic... 

    Generalized intelligent Water Drops algorithm by fuzzy local search and intersection operators on partitioning graph for path planning problem

    , Article Journal of Intelligent and Fuzzy Systems ; Volume 29, Issue 2 , 2015 , Pages 975-986 ; 10641246 (ISSN) Monfared, H ; Salmanpour, S ; Sharif University of Technology
    IOS Press  2015
    Abstract
    In this paper, a generalized intelligent water drops algorithm (IWD) for solving robot path planning problem is proposed. The authors want to reduce the time of reaching the optimal solution as much as possible. To do this, some new heuristic operators and a multi section graph model of environment is introduced. The authors divide graph to equal sections and compare behaviour of the solutions (paths) in each section with behaviour of them in other sections. This comparison uses a fuzzy inference system. Base on this comparison, a fuzzy number is assigned to each part of solutions. This fuzzy number determines the worth of a solution in a section. Less worth solutions need more improvement.... 

    A voronoi-based reactive approach for mobile robot navigation

    , Article 13th International Computer Society of Iran Computer Conference on Advances in Computer Science and Engineering, CSICC 2008, Kish Island, 9 March 2008 through 11 March 2008 ; Volume 6 CCIS , 2008 , Pages 901-904 ; 18650929 (ISSN); 3540899847 (ISBN); 9783540899846 (ISBN) Mohammadi, S ; Hazar, N ; Sharif University of Technology
    2008
    Abstract
    Robot navigation is a challenging problem in robotics, which involves determining of robot positioning relative to objects in the environment, and also the mobility of robot through obstacles without colliding into them. The former is known as localization, while the latter is called motion planning. This paper introduces a roadmap method for solving motion planning problem in a dynamic environment based on Generalized Voronoi Diagram (GVD). The efficiency of the proceeding work is verified by examining it in a sample home environment. © 2008 Springer-Verlag  

    A simulation model for train movements in the rail network

    , Article Proceedings of the Institution of Civil Engineers: Transport ; Volume 172, Issue 3 , 2019 , Pages 152-163 ; 0965092X (ISSN) Moeinaddini, A ; Shafahi, Y ; Mohammad Hasany, R ; Sharif University of Technology
    ICE Publishing  2019
    Abstract
    In rail transportation, the process of finding the optimal movement of freight goods is considered a tactical level of rail planning. Solving this problem requires one simultaneously to address the railroad blocking problem and the train dispatching problem, which is difficult. Additionally, when these problems are represented by mathematical relations, application of the solution leads to unexpected results in the real world. The main objective of this research was to build a simulation environment to represent the key behaviours of typical and applicable constraints of a railway system. This environment provides a tool with which to evaluate different decisions among a list of candidate... 

    A bi-objective aggregate production planning problem with learning effect and machine deterioration: modeling and solution

    , Article Computers and Operations Research ; Volume 91 , March , 2018 , Pages 21-36 ; 03050548 (ISSN) Mehdizadeh, E ; Akhavan Niaki, S. T ; Hemati, M ; Sharif University of Technology
    Elsevier Ltd  2018
    Abstract
    The learning effects of the workers and machine deterioration in an aggregate production planning (APP) problem have not been taken into account in the literature yet. These factors affect the performance of any real-world production system and require attention. In this paper, a bi-objective optimization model is developed for an APP problem with labor learning effect and machine deterioration. The first objective of this model maximizes the profit by improving learning and reducing the failure cost of the system. The second objective function minimizes the costs associated with repairs and deterioration, which depend on the failure rate of the machines in the production periods. The aim of... 

    Optimal maneuver-based motion planning over terrain and threats using a dynamic hybrid PSO algorithm

    , Article Aerospace Science and Technology ; Volume 26, Issue 1 , April–May , 2013 , Pages 60-71 ; 12709638 (ISSN) Karimi, J ; Pourtakdoust, S. H ; Sharif University of Technology
    2013
    Abstract
    Motion planning is a key factor in enhancing the autonomy level of unmanned flying vehicles. A new dynamic hybrid algorithm is developed to solve the motion planning problem in real-time using a heuristic optimization approach. The proposed algorithm effectively combines desired features such as rapid convergence to an optimal path with reduced computational effort. In addition to the terrain obstacles, the proposed algorithm is able to avoid random threats that may arise sporadically in the terrain. Using the maneuver automaton concept, nonlinear dynamic model and performance constraints are also considered in the process of motion planning to further ensure feasible trajectories.... 

    Integrated motion planning and trajectory control system for unmanned air vehicles

    , Article Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering ; Volume 227, Issue 1 , 2013 , Pages 3-18 ; 09544100 (ISSN) Karimi, J ; Pourtakdoust, S. H ; Sharif University of Technology
    2013
    Abstract
    Motion planning and trajectory control are two basic challenges of unmanned vehicles. In motion planning problem, feasible trajectories are developed while nonlinear dynamic model and performance constraints of the vehicle under utility are considered. In this study, motion planning is performed via an enhanced particle swarm optimization algorithm. The resulting offline generated trajectories are tracked using a nonlinear trajectory control system methodology. The Lyapunov-based constrained backstepping approach and command filters are utilized in designing the trajectory control system. Command filters smoothen the input signals and provide their derivatives. Evaluation of the proposed... 

    Reliability-Based expansion planning studies of active distribution networks with multiagents

    , Article IEEE Transactions on Smart Grid ; Volume 13, Issue 6 , 2022 , Pages 4610-4623 ; 19493053 (ISSN) Kabirifar, M ; Fotuhi Firuzabad, M ; Moeini Aghtaie, M ; Pourghaderi, N ; Shahidehpour, M ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2022
    Abstract
    In this paper, a multi-agent framework is proposed to address the expansion planning problem in a restructured active distribution network. In this framework, the objective and techno-economic constraints of participating agents are addressed in the expansion planning of power network and DER assets as well as the network and DERs optimal operation management. The agents include distributed generator owners and load aggregators which participate along with the distribution network operator (DNO) in the active distribution network planning. The proposed framework is formulated as a bi-level optimization problem with multi-lower levels in which the DNO optimizes the network expansion planning...