Kemal Lutvica, J. Velagić, Nihad Kadic, N. Osmic, Gregor Dzampo, Hajrudin Muminovic
{"title":"Remote path planning and motion control of mobile robot within indoor maze environment","authors":"Kemal Lutvica, J. Velagić, Nihad Kadic, N. Osmic, Gregor Dzampo, Hajrudin Muminovic","doi":"10.1109/ISIC.2014.6967625","DOIUrl":"https://doi.org/10.1109/ISIC.2014.6967625","url":null,"abstract":"The paper proposes a wireless navigation mobile robot system for both path planning and trajectory execution within an indoor maze environment. This system consists of the mobile robot, trajectory planner, motion controller, visual sensor (CCD camera), ZigBee wireless communication device and a maze terrain. The camera is used to capture images of the mobile robot within the maze. Developed image processing and analyzing algorithms determine the robot's position and orientation based on color markers recognition. Markers are mounted on the top of the robot. Based on this data the implemented navigation system calculates a trajectory for the mobile robot from a starting point to a target point. The proposed navigation system is an upgrade to our previously developed system. Maze encryption and motion planning modules have been added to the previous system. Breadth First Search (BFS) and modified Depth First Search (DFS) algorithms were used for the trajectory calculation. A developed control algorithm calculates control signals in real time. These signals are sent to the robot via modules for wireless communication, causing robot motion along the calculated trajectory and eventually, the completion of the trajectory. The whole control system is realized and experimental results have been obtained. The experimental results confirm the robustness and effectiveness of the implemented control system.","PeriodicalId":309111,"journal":{"name":"2014 IEEE International Symposium on Intelligent Control (ISIC)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126918428","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A flexible virtual structure formation keeping control design for nonholonomic mobile robots with low-level control systems, with experiments","authors":"C. B. Low","doi":"10.1109/ISIC.2014.6967622","DOIUrl":"https://doi.org/10.1109/ISIC.2014.6967622","url":null,"abstract":"This paper presents a flexible virtual structure formation keeping control design for nonholonomic mobile robots that are driven by low-level velocities control systems that possess non-trivial dynamical effects. The formation is flexible in the sense that the formation configuration is defined based on a set of curvilinear relative separations instead of commonly used rectilinear relative separations. The main contribution of this work is the use of a novel concept of formation reference generation to compute accurate formation reference pose in real-time based on curvilinear relative separation coordinates along the virtual formation leader trajectory. Another contribution of this work is the application of a recently developed trajectory tracking control scheme, which enables the considered mobile robots to track their formation reference poses stably when executing the formation maneuvers. This formation control scheme allows a virtual formation leader to guide the formation of mobile robots flexibly in an environment to carry out its formation navigation tasks. The formation control performance was validated in both simulations and experimentations. Field trials were conducted in some off-road environments at speeds up to 4m/sec to validate the control design. The scheme was implemented on a full-sized nonholonomic tracked vehicle, following a virtual leader in formation. The obtained simulations and experimental results confirm the effectiveness of the proposed formation control scheme.","PeriodicalId":309111,"journal":{"name":"2014 IEEE International Symposium on Intelligent Control (ISIC)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128737332","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Optimality of consensus protocols for multi-agent systems with interaction","authors":"Hirotaka Katsuura, Y. Fujisaki","doi":"10.1109/ISIC.2014.6967600","DOIUrl":"https://doi.org/10.1109/ISIC.2014.6967600","url":null,"abstract":"This paper deals with consensus protocols for multi-agent systems with interaction. Each agent is driven by distributed control for achieving consensus, while it is simultaneously influenced by distributed disturbance for disturbing consensus. That is, two kinds of interconnections are considered, where the interconnections are assumed to be described as undirected graphs possibly different. A necessary and sufficient condition is stated for consensus achievement. A sufficient condition for optimality of the consensus is then presented as the key result of this paper, where it is shown that the distributed feedback can minimize a quadratic performance index under this condition. These two conditions are further investigated, and the graph topology desirable for consensus achievement is established from the viewpoint of inverse optimality.","PeriodicalId":309111,"journal":{"name":"2014 IEEE International Symposium on Intelligent Control (ISIC)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127818494","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
R. Precup, E. Petriu, L. Fedorovici, M. Radac, Florin Dragan
{"title":"Multi-robot charged system search-based optimal path planning in static environments","authors":"R. Precup, E. Petriu, L. Fedorovici, M. Radac, Florin Dragan","doi":"10.1109/ISIC.2014.6967643","DOIUrl":"https://doi.org/10.1109/ISIC.2014.6967643","url":null,"abstract":"This paper proposes an optimal path planning approach based on Charged System Search (CSS) algorithms. The approach is applied to multiple mobile robots on holonomic wheeled platforms. Optimization problems (o.p.s) are defined for each robot to minimize the weighted sum of four objective functions whose minimization targets four path planning objectives. The CSS algorithms are mapped onto the o.p.s considering that the fitness functions are the objective functions, the search spare is the solution space, the agents (charged particles) are the mobile robots, and the population of agents is the set of mobile robots. Therefore, the optimal solutions to the o.p.s are the optimal paths. The new path planning approach is validated by experiments, and a comparison with other nature-inspired optimization-based path planning approaches is given.","PeriodicalId":309111,"journal":{"name":"2014 IEEE International Symposium on Intelligent Control (ISIC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129574459","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Neural network dynamic progamming constrained control of distributed parameter systems governed by parabolic partial differential equations with application to diffusion-reaction processes","authors":"B. Talaei, Hao Xu, S. Jagannathan","doi":"10.1109/ISIC.2014.6967634","DOIUrl":"https://doi.org/10.1109/ISIC.2014.6967634","url":null,"abstract":"In this paper, a novel neural network (NN) adaptive dynamic programming (ADP) control scheme for distributed parameter systems (DPS) governed by parabolic partial differential equations (PDE) is introduced in the presence of control constraints and unknown system dynamics. First, Galerkin method is utilized to develop a relevant reduced order system which captures the dominant dynamics of the DPS. Subsequently, a novel control scheme is proposed over finite horizon by using NN ADP. To relax the requirement of system dynamics, a novel NN identifier is developed. More-over, a second NN is proposed to estimate online the time-varying non-quadratic value function from the Hamilton-Jacobi-Bellman (HJB) equation. Subsequently, by using the identifier and the value function estimator, the optimal control input that inherently lies in actuation limits is obtained. A local uniform ultimate boundedness (UUB) of the closed-loop system is verified by using standard Lyapunov theory. The performance of proposed control scheme and effects of its design parameters are successfully verified by simulation on a diffusion reaction process.","PeriodicalId":309111,"journal":{"name":"2014 IEEE International Symposium on Intelligent Control (ISIC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123232565","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Discrete Cuckoo Search algorithm for job shop scheduling problem","authors":"Aziz Ouaarab, B. Ahiod, Xin-She Yang, M. Abbad","doi":"10.1109/ISIC.2014.6967636","DOIUrl":"https://doi.org/10.1109/ISIC.2014.6967636","url":null,"abstract":"This paper presents an application of Discrete Cuckoo Search (DCS) algorithm for solving the Job Shop Scheduling Problem (JSSP), one of the most difficult NP-hard combinatorial optimization problems. DCS is recently developed by Ouaarab et al. in 2013, based on Cuckoo Search (CS), proposed by Yang and Deb in 2009. DCS performs its search via Lévy flights by proposing three different steps to move in the search space. It applies a search balance between local and global random walk. The performance of DCS is tested on a set of benchmarks of JSSP from the OR-Library. The test results are compared with a Particle Swarm Optimization (PSO) algorithm and they showed that DCS outperforms PSO.","PeriodicalId":309111,"journal":{"name":"2014 IEEE International Symposium on Intelligent Control (ISIC)","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128492577","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Robust adaptive dynamic programming for continuous-time linear stochastic systems","authors":"T. Bian, Zhong-Ping Jiang","doi":"10.1109/ISIC.2014.6967601","DOIUrl":"https://doi.org/10.1109/ISIC.2014.6967601","url":null,"abstract":"In this paper, a robust optimal control problem is investigated for continuous-time linear stochastic systems with dynamic uncertainties. A non-model based stochastic robust optimal control design methodology is employed to iteratively update the control policy online by directly using the online information. A robust adaptive dynamic programming (RADP) algorithm is developed, together with rigorous convergence and stability analysis. The effectiveness of the proposed method is also illustrated by an example of two connected inverted pendulums.","PeriodicalId":309111,"journal":{"name":"2014 IEEE International Symposium on Intelligent Control (ISIC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126412511","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Supervisory system identification for bilinear systems with application to thermal dynamics in buildings","authors":"Georgios C. Chasparis, T. Natschläger","doi":"10.1109/ISIC.2014.6967608","DOIUrl":"https://doi.org/10.1109/ISIC.2014.6967608","url":null,"abstract":"When system identification is performed online and predictions of the system response are requested often (as in model predictive control formulations), the identification model with the best performance may not be fixed with time. Besides, more accurate models may require larger training times compared to low-order linear models. This is particularly evident in thermal dynamics in buildings where operating conditions may change throughout the year. To this end, this paper introduces a supervisory identification process, tailored specifically for input-output stable bilinear systems, where two parallel decision processes run periodically. The first one is concerned with the selection of the appropriate partition of the input(s) domain, while the second one is concerned with the selection of the identification model for each one of the resulting partition sets. The overall identification model constitutes a switched system. We show analytically that the proposed scheme is adaptive and robust to changes in the performance of the identification models, while convergence is attained (in probability) to the best model.","PeriodicalId":309111,"journal":{"name":"2014 IEEE International Symposium on Intelligent Control (ISIC)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131639977","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A new velocity observer for a class of double integrator dynamics","authors":"H. Ahn, Young-Cheol Choi, Kwang‐Kyo Oh","doi":"10.1109/ISIC.2014.6967629","DOIUrl":"https://doi.org/10.1109/ISIC.2014.6967629","url":null,"abstract":"This paper proposes a new velocity observer for a class of nonlinear double integrator dynamics. Mainly, supposing that the nonlinear terms and control input in the double integrator are bounded, we design a simple observer that is structured only with a feedback of estimation position error. Unlike to existing works that mostly have been developed from super-twisting algorithm, this paper does not use any sign function in the velocity observer. Thus, the overall structure of the proposed observer is much simple than existing approaches, while the desired convergence is analytically ensured. From numerical simulation, the validity of the proposed method is illustrated.","PeriodicalId":309111,"journal":{"name":"2014 IEEE International Symposium on Intelligent Control (ISIC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129905607","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A static obstacle collision mitigation control scheme for flexible formation of nonholonomic mobile robots, with experiments","authors":"C. B. Low, Y. Yeo","doi":"10.1109/ISIC.2014.6967624","DOIUrl":"https://doi.org/10.1109/ISIC.2014.6967624","url":null,"abstract":"In this paper, a static obstacle collision mitigation scheme is proposed for flexible formation of nonholonomic mobile robots. The aim of the collision mitigation scheme is to prevent a flexible formation of mobile robots from colliding with online detected static obstacles or to decrease the kinetic energy of the collision through coordinated formation braking. The key thrust of the proposed control scheme is that the scheme is able to guarantee a formation braking solution that prevents a formation of mobile robots from colliding with the detected static obstacles under some practically feasible assumptions. The control scheme is based on an online obstacle collision detection module and a formation braking module equipped on each robot to perform the obstacle collision mitigation. The scheme was validated in numerical simulations and partial experiments were conducted for proof-of-concept in some off-road environments at speeds up to 3 m/sec.","PeriodicalId":309111,"journal":{"name":"2014 IEEE International Symposium on Intelligent Control (ISIC)","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117161486","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}