Search

Background: Despite its obvious relevance to computer science, computational thinking (CT) is transdisciplinary with the potential of impacting one's analytical ability. Although countless efforts have been invested across K‐12 education, there is a paucity of research at the postsecondary level about the extent to which CT can contribute to sustainable learning outcomes. Objectives: The current study examines how a series of Arduino‐based robotics learning activities capture the fuller essence of concepts related to CT. Methods: College students (n = 50) completed a series of six robotics learning activities. Think‐alouds, student reflections and performance scores were used to assess students' CT through a robotics challenge in virtual and physical learning environments. Results and Conclusions: Students verbalized CT concepts related to algorithmic thinking much more than abstraction, problem decomposition and testing and debugging. Students exposed to active learning performed better in a virtual robotics challenge compared to their peers in a traditional‐oriented classroom. Students' scores on the physical robotics challenge increased as a function of the number of references they made to CT concepts during the think‐alouds. It is possible to design pedagogical experiences that tap into various dimensions of CT at incremental levels of complexity through a series of Arduino‐based robotics activities. With the integration of an online simulation, students can visualize and transfer their CT skills between a virtual and physical learning environment, thus leading to more sustainable learning outcomes. Lay Description: What is already known about this topic: Computational thinking (CT) is the conceptual foundation for problem‐solving.CT shifted from unplugged to plugged activities.CT concepts can be fostered through educational robotics. What this paper adds: A multi‐dimensional approach to assessing CT.Applications of CT provide insights into skill transfer.An integrative theoretical approach to study the 'how' and the 'what' of CT. Implications for practice: Educational robotics activities can cater to a fuller range of CT skills.Virtual simulations with constructive feedback are beneficial for students in traditional settings.Mixed learning environments contribute to making links between lectures and labs. [ABSTRACT FROM AUTHOR]

Close-range photogrammetry methods are widely used for non-contact and accurate measurements of surface shapes. These methods are based on calculating the three-dimensional coordinates of an object from two-dimensional images using special digital processing algorithms. Due to the relatively complex measurement principle, the accurate estimation of the photogrammetric measurement error is a non-trivial task. Typically, theoretical estimations or computer modelling are used to solve this problem. However, these approaches cannot provide an accurate estimate because it is impossible to consider all factors that influence the measurement results. To solve this problem, we propose the use of physical modelling. The measurement results from the photogrammetric system under test were compared with the results of a more accurate reference measurement method. This comparison allowed the error to be estimated under controlled conditions. The test object was a flexible surface whose shape could vary smoothly over a wide range. The estimation of the measurement accuracy for a large number of different surface shapes allows us to obtain new results that are difficult to obtain using standard approaches. To implement the proposed approach, a laboratory system for the error estimation of close-range photogrammetric measurements was developed. The paper contains a detailed description of the developed system and the proposed technique for a comparison of the measurement results. The error in the reference method, which was chosen to be phasogrammetry, was evaluated experimentally. Experimental testing of the stereo photogrammetric system was performed according to the proposed technique. The obtained results show that the proposed technique can reveal dependencies that may not be detected by standard approaches. [ABSTRACT FROM AUTHOR]

The envisaged usage of multiple Unmanned Aerial Vehicles (UAVs) to perform cooperative tasks is a promising concept for future autonomous military systems. An important aspect to make this usage a reality is the solution of the task allocation problem in these cooperative systems. This paper addresses the problem of tasks allocation among agents representing UAVs, considering that the tasks are created by a central entity, in which the decision of which task will be performed by each agent is not decided by this central entity, but by the agents themselves. The assumption that tasks are created by a central entity is a reasonable one, given the way strategic planning is carried up in military operations. To enable the UAVs to have the ability to decide which tasks to perform, concepts from swarm intelligence and multi-agent system approach are used. Heuristic methods are commonly used to solve this problem, but they present drawbacks. For example, many tasks end up not begin performed even if the UAVs have enough resources to execute them. To cope with this problem, this paper proposes three algorithm variants that complement each other to form a new method aiming to increase the amount of performed tasks, so that a better task allocation is achieved. Through experiments in a simulated environment, the proposed method was evaluated, yielding enhanced results for the addressed problem compared to existing methods reported in the literature. [ABSTRACT FROM AUTHOR]

In order to solve the problem that communication and computing resources are consumed in the first order multiagent system circle formation with communication delay, this paper introduced an event-driven control mechanism, and designed the control law for arbitrary circle formation, which was coupling with state dependent and state independent event-driven conditions. Event-triggered function was based on state error, made the information transmission between two neighbor agents and the controller updates driven by properly defined events. It proved the convergence of the control law strictly and theoretically, and the numerical simulation validated the effectiveness of control algorithm. The simulation results also s how that the updating frequency of the controller and the resource consumption of the agent are reduced with the desired system performance. [ABSTRACT FROM AUTHOR]

Orienteering problem (OP) is a routing problem, where the aim is to generate a path through set of nodes, which would maximize total score and would not exceed the budget. In this paper, we present an extension of classic OP—Orienteering Problem with Functional Profits (OPFP), where the score of a specific point depends on its characteristics, position in the route, and other points in the route. For solving OPFP, we developed an open-source framework for solving orienteering problems, which utilizes four core components of OP in its modular architecture. Fully-written in Go programming language our framework can be extended for solving different types of tasks with different algorithms; this was demonstrated by implementation of two popular algorithms for OP solving—Ant Colony Optimization and Recursive Greedy Algorithm. Computational efficiency of the framework was shown through solving four well-known OP types: classic Orienteering Problem (OP), Orienteering Problem with Compulsory Vertices (OPCV), Orienteering Problem with Time Windows (OPTW), and Time Dependent Orienteering Problem (TDOP) along with OPFP. Experiments were conducted on a large multi-source dataset for Saint Petersburg, Russia, containing data from Instagram, TripAdvisor, Foursquare and official touristic website. Our framework is able to construct touristic paths for different OP types within few seconds using dataset with thousands of points of interest. [ABSTRACT FROM AUTHOR]

In pulsed Doppler radars, subsampling causes incorrect estimates of the radial velocity of the detected targets whenever its related Doppler frequency is greater than the pulse repetition frequency of the radar. The classic Chinese remainder theorem is a well-known method to overcome this problem. On the other hand, the robust Chinese remainder theorem is a search-based algorithm that, under some conditions, can guarantee the correct estimation of the Doppler frequency. In this paper, we have derived the exact probability of detection for both methods applied in a pulsed Doppler radar. Simulations have been compared to the analytical results and have shown an excellent agreement. [ABSTRACT FROM AUTHOR]

This paper presents a whole body control framework for the control of a dual arm underwater vehicle manipulator system developed in the context of the MARIS Italian research project, which deals with the control and coordination of underwater vehicles for manipulation and transportation problems. The proposed framework is the extension of the one used in the successful TRIDENT FP7 project that has been improved to be able to deal with multidimensional inequality control objectives. After the presentation of the mathematical background, the paper presents some simulation results showing the good performances of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Design of conventional correlation filters requires explicit knowledge of the appearance and shape of a target object, so the performance of correlation filters is significantly affected by changes in the appearance of the object in the input scene. In particular, the performance of correlation filters worsens when objects to be recognized are partially occluded by other objects, and the input scene contains a cluttered background and noise. In this paper, we propose a new algorithm for the design of a system consisting of a set of adaptive correlation filters for recognition of partially occluded objects in noisy scenes. Since the input scene may contain different fragments of the target, false objects, and background to be rejected, the system is designed in such a manner to guarantee equally high correlation peaks corresponding to parts of the target in the scenes. The key points of the system are as follows: (i) it consists of a bank of composite optimum filters, which yield the best performance for different parts of the target; (ii) it includes a fragmentation of the target into a given number of parts in the training stage to provide equal intensity responses of the system for each part of the target. With the help of computer simulation, the performance of the proposed algorithm for recognition partially occluded objects is compared with that of common algorithms in terms of objective metrics. [ABSTRACT FROM AUTHOR]

Imagine coating buildings and bridges with smart particles (also coined smart paint) that monitor structural integrity and sense and report on traffic and wind loads, leading to technology that could do such inspection jobs faster and cheaper and increase safety at the same time. In this paper, we study the problem of uniformly coating objects of arbitrary shape in the context of self-organizing programmable matter, i.e., programmable matter which consists of simple computational elements called particles that can establish and release bonds and can actively move in a self-organized way. Particles are anonymous, have constant-size memory, and utilize only local interactions in order to coat an object. We continue the study of our universal coating algorithm by focusing on its runtime analysis, showing that our algorithm terminates within a linear number of rounds with high probability. We also present a matching linear lower bound that holds with high probability. We use this lower bound to show a linear lower bound on the competitive gap between fully local coating algorithms and coating algorithms that rely on global information, which implies that our algorithm is also optimal in a competitive sense. Simulation results show that the competitive ratio of our algorithm may be better than linear in practice. [ABSTRACT FROM AUTHOR]

Fast and accurate detection of fault location in distribution networks, is one of the important issues in operation of the system. In this paper, an approach based on Binary Imperialistic Competitive algorithm and Nelder-Mead simplex search has been proposed for placement of fault indicators in distribution networks. By using this method, the problem of locating fault indicators can be solved faster and more accurately by minimizing of cost function. In this paper, in addition to describing the BICA-NM hybrid algorithm, the fault indicator placement has been implemented using this method on a test system, and the simulation results have been compared with Genetic algorithm (GA), Binary Shuffled Frog Leap Algorithm (BSFLA) and Improved BSFLA (IBSFLA) and the accuracy and fastness of the proposed method has been demonstrated. [ABSTRACT FROM AUTHOR]

With a small number of elements in uniform circular arrays (UCAs), the performance of beamspace transformation (BT) based methods for 2D direction-of-arrival (DOA) estimation in the presence of mutual coupling suffers serious degradation. The performance breakdown is associated with the residual term which is introduced by the BT. To solve this problem, a novel algorithm which modifies the beamspace data is proposed in this paper. Based on the estimated azimuth angles obtained by a UCA-RARE-like method and the estimated elevation angles obtained by a new searching method, the beamspace data is iteratively revised by removing its residual component. Thus, unbiased 2D DOA estimates can be obtained depending on the revised beamspace data. Simulation results are given to verify the effectiveness of the proposed algorithm and a comparison is made with results from existed methods. [ABSTRACT FROM AUTHOR]

This paper studies the distributed average tracking problem for multiple time-varying signals generated by linear dynamics, whose reference inputs are nonzero and not available to any agent in the network. In the edge-based framework, a pair of continuous algorithms with, respectively, static and adaptive coupling strengths is designed. Based on the boundary layer concept, the proposed continuous algorithm with static coupling strengths can asymptotically track the average of multiple reference signals without the chattering phenomenon. Furthermore, for the case of algorithms with adaptive coupling strengths, average tracking errors are uniformly ultimately bounded and exponentially converge to a small adjustable bounded set. Finally, a simulation example is presented to show the validity of theoretical results. [ABSTRACT FROM AUTHOR]

This paper presents a new Electromagnetism-like Mechanism (EM) algorithm with Split, Probe and Compare feature (SPC-EM). The proposed algorithm replaces the local search segment of a standard EM with a new search scheme named Split, Probe, and Compare (SPC). A nonlinear equation is designed to systematically and dynamically adjust the length of the probes based on the outcome of the Compare segment in each iteration. Extensive computational simulations and comparisons on 10 different benchmark problems from the literature were carried out. Results show that the new modified mechanism outperformed all other algorithms involved in the benchmarking. We thus conclude that the proposed SPC-EM works well with the designed probe-length tuning equation in solving numerical optimization problems. [ABSTRACT FROM AUTHOR]

The premixed turbulent V-flame is numerically simulated in this paper. The technique used in Chan et al. [Effect of intense turbulence on turbulent premixed V-flame, Int. J. Eng. Sci. 41 (2003), pp. 903-916; Simulation of a premixed turbulent flame with the discrete vortex method, Int. J. Numer. Methods Eng. 48 (2000), pp. 613-627] was based on the random vortex method and the conventional level set method. However, this paper is an improvement of the previous technique by using a conservative level set method. The new algorithm uses a bi-cubic interpolation process together with Newton's method to reconstruct the velocity field to improve the conservation of the level set method. The numerical example in this paper indicates the efficiency of the new method in solving the problem of turbulent premixed V-flame by comparing the results with available data. [ABSTRACT FROM AUTHOR]

Abstract: Computer simulation is an increasingly popular tool for determining the most suitable hybrid energy system type, design and control for an isolated community or a cluster of villages. This paper presents the development of the optimum control algorithm based on combined dispatch strategies, to achieve the optimal cost of battery incorporated hybrid energy system for electricity generation, during a period of time by solving the mathematical model, which was developed in Part I of this tri-series paper. The main purpose of the control system proposed here is to reduce, as much as possible, the participation of the diesel generator in the electricity generation process, taking the maximum advantage of the renewable energy resources available. The overall load dispatch scenario is controlled by the availability of renewable power, total system load demand, diesel generator operational constraints and the proper management of the battery bank. The incorporation of a battery bank makes the control operation more practical and relatively easier. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the joint design of a transmit beampattern and angular waveform (AW) for colocated multiple-input multiple-output (MIMO) radars. The importance of the AW in the proposed signal processing strategy is first clarified, and then, two optimization models are established, which are aimed at either the power spectral density (PSD) design or the spectral compatibility and similarity design of the AW. There are two main differences between the proposed models and existing models. First, instead of matching a desired template or maximizing the transmit power on specific regions, the transmit beampattern in this paper is optimized to approach several key points, which guarantees the high transmit gain and the flexible adjustment of each beam gain. Second, instead of optimizing the performance of the transmit waveform, only the characteristics of the AW are examined, and they can be constrained quantitatively according to their relationship with the transmit gain. The two models can be unified into the same framework, and an efficient algorithm is proposed to solve the problem under a constant modulus constraint. The convergence of the proposed algorithm is demonstrated, and some improvements to reduce the computational complexity are proposed. Numerical simulations showed that compared to the existing methods, the proposed approach can be used to obtain a higher transmit gain, flexibly adjust each beam gain, and more accurately control the PSD, spectral compatibility, and similarity of the AW. Moreover, numerical simulations showed that, compared to the use of existing methods, the proposed algorithm has higher computational efficiency. [ABSTRACT FROM AUTHOR]

This paper proposes a novel distributed event-triggered algorithmic solution to the multi-agent average consensus problem for networks whose communication topology is described by weight-balanced, strongly connected digraphs. The proposed event-triggered communication and control strategy does not rely on individual agents having continuous or periodic access to information about the state of their neighbors. In addition, it does not require the agents to have a priori knowledge of any global parameter to execute the algorithm. We show that, under the proposed law, events cannot be triggered an infinite number of times in any finite period (i.e., no Zeno behavior), and that the resulting network executions provably converge to the average of the initial agents’ states exponentially fast. We also provide weaker conditions on connectivity under which convergence is guaranteed when the communication topology is switching. Finally, we also propose and analyze a periodic implementation of our algorithm where the relevant triggering functions do not need to be evaluated continuously. Simulations illustrate our results and provide comparisons with other existing algorithms. [ABSTRACT FROM AUTHOR]

A Chunk by chunk-based allocation is an emerging subcarrier allocation in Single Carrier Frequency Division Multiple Access (SC-FDMA) due to its low complexity. In this paper, a combined userorder and chunk-order allocation for solving chunk allocation problem which minimizes the average BER of all users while improving the throughput in SC-FDMA uplink is proposed. The subcarrier grouping into a chunk of all users on both-order allocations are performed by averaging the BER of a contiguous subcarriers within a chunk. The sequence of allocation is according to the average of users' BER on userorder allocation and the average of chunks' BER on chunk-order allocation. The best allocation is determined by choosing one of both-order allocations which provides the smaller BER systems. The simulation results showed that the proposed algorithm can outperform the previous algorithms in term of average BER and throughput without increase the time complexity. [ABSTRACT FROM AUTHOR]

A novel attitude algorithm for fiber strapdown inertial navigation system (SINS) is studied in this paper. The noncommutativity rotation is one of the major errors in attitude updating for SINS. As a general rule, accuracy can be improved by increasing attitude updating frequency. However, it is limited by gyro and computer technology. To solve this problem, a modified algorithm for fiber SINS is proposed. This algorithm uses angular rate as algorithm input and estimates the noncommutativity error with the cross product of angular rates and the cross product of previous accumulated gyro outputs with current gyro outputs. Simulations and experiments are performed under coning motion and three-axis turntable environment, and the results show that the accuracy of the proposed algorithm can be improved effectively under coning motion, as well as in three-axis turntable environment, though not as greatly. [ABSTRACT FROM AUTHOR]

The long term of this ongoing research has to do with increasing degree of autonomy for robots involved in underwater intervention missions. Bearing in mind that the specific mission to face has been the intervention on a panel, in this paper some results in different development stages are presented by using the real mechatronics and the panel mockup. Furthermore, some details are highlighted describing two methodologies implemented for the required visually-guided manipulation algorithms. These algorithms are used to correct problems caused by a bad initialization or miscalibration of the arm. They consist of detecting a marker placed in a known position of the arm and updating the value of each joint after any detection. A roadmap explaining the different testbeds used for experimental validation, in increasing complexity order, is also presented. It is worth mentioning that the aforementioned results would be impossible without previously generated know-how for both the complete developed mechatronics for the autonomous underwater vehicle for intervention, and the required 3D simulation tool. In summary, thanks to the implemented approach, the intervention system is able to control the way in which the gripper approximates and manipulates the two panel devices (i.e. a valve and a connector) in an autonomous manner. Results in different scenarios demonstrate the reliability and feasibility of this autonomous intervention system in water tank and pool conditions. [ABSTRACT FROM AUTHOR]

In the clutter environments, persistently tracking multiple objects is still a very challenging problem. In this paper, an A * algorithm with dynamic weights is developed to solve this problem. Firstly, the problem of multiple object tracking is considered as an integer programming of flow network model. Based on this model, afterward, we relax the problem of integer programming problem to a standard linear programming and achieve the global optimal solution with the proposed algorithm, which has been proven in this work. Compared with other advanced methods employed in the modern complex environments, the proposed method is on the merit of lower calculation complexity and better tracking accuracy and robustness. Finally, the simulation result is demonstrated, which reveals that the proposed algorithm saves the time costs vastly. [ABSTRACT FROM AUTHOR]

Ethernet passive optical network is a point-to-multipoint structure, and an effective media access protocol should be designed for collision avoidance and bandwidth allocation. Most previous researches have aimed to solve the problem using dynamic bandwidth allocation (DBA) algorithms with polling-based schemes. Unfortunately, idle channel time among the polling cycles cannot be overcome efficiently. In this paper, a dual-polling DBA (DP-DBA) algorithm which consists of an interpolling mechanism and an intrapolling mechanism is proposed. The interpolling mechanism helps eliminate the idle time problem while the intrapolling part aggregates the unused bandwidth of the light-loaded users and those due to nondefragmentation of the Ethernet frames of the general users. We also evaluate the performance of the DP-DBA algorithm by a comparison with the interleaved polling with adaptive cycle time (IPACT), the dynamic bandwidth allocation with a modified grant table generation algorithm (DBA2), the Double-Phase Polling (DPP), and the adaptive DBA algorithm with sorting report messages (Sort-DBA) schemes with simulation results. For greater realism with regard to general applications, we also simulate the asymmetric traffic loads at the optical network units (ONUs).The results show that DP-DBA outperforms the other DBA schemes under asymmetric load conditions. [ABSTRACT FROM AUTHOR]

This paper addresses the problem of trajectory tracking control for underactuated autonomous underwater vehicles (AUVs) in 3 dimensions space. Given a smooth, inertial, 3D reference trajectory, in order to make the position error to stay in the neighborhood of zero, the control algorithm uses vehicle׳s kinematic equation and linear system stability theory to compute the desired body-fixed velocities. Using these methods, the velocity error dynamics are obtained. Backstepping techniques are used, forcing the tracking error to an arbitrarily small neighborhood of zero. Simulation of a spiral trajectory is performed. The result shows that the controller can realize 3 dimensions trajectory tracking effectively. [ABSTRACT FROM AUTHOR]

The paper addresses nonlinear estimation problems on nonlinear processes containing several lab measurements sampled slowly and with long delay, which is the usual case in industrial polymerization applications. A moving horizon estimation algorithm is developed to compute the theoretical optimal solution given the multi-rate measurements. In this algorithm, the MHE window is recalculated as the new lab measurement becomes available. Simulation studies on a polymerization process with plant model mismatch are performed. Observability analysis and estimation results of MHE with and without lab measurements show that lab measurements help identify the disturbances and can improve the performance of both estimation and closed-loop control. [ABSTRACT FROM AUTHOR]

The paper presents the stress-strain state simulation of the compound technical structure - vulcanizer diaphragm. A set of working plates in the form of a circular plate with the thickness discretely varied in the radial direction is modeled. An algorithm to solve the contact problem is developed. The obtained calculation results are compared with the experimental ones to demonstrate their practical use. [ABSTRACT FROM AUTHOR]

Recent years have witnessed the increasing of available network data; however, much of those data is incomplete. Link prediction, which can find the missing links of a network, plays an important role in the research and analysis of complex networks. Based on the assumption that two unconnected nodes which are highly similar are very likely to have an interaction, most of the existing algorithms solve the link prediction problem by computing nodes' similarities. The fundamental requirement of those algorithms is accurate and effective similarity indices. In this paper, we propose a new similarity index, namely similarity based on activity and connectivity (SAC), which performs link prediction more accurately. To compute the similarity between two nodes, this index employs the average activity of these two nodes in their common neighborhood and the connectivities between them and their common neighbors. The higher the average activity is and the stronger the connectivities are, the more similar the two nodes are. The proposed index not only commendably distinguishes the contributions of paths but also incorporates the influence of endpoints. Therefore, it can achieve a better predicting result. To verify the performance of SAC, we conduct experiments on 10 real-world networks. Experimental results demonstrate that SAC outperforms the compared baselines. [ABSTRACT FROM AUTHOR]

Multi-agent technology is applied in this paper to solve the distribution system service restoration problems. Specifically, switches in the distribution systems are modeled as intelligent agents and organized as local power committees in a distribution system. The advantage of this approach is to utilize the solving ability of a local committee of agents who could coordinate with neighboring committees to achieve an agreement that satisfies the global objective of the power distribution system service restoration problems without relying on a pre-determined centralized optimization algorithm as traditional approaches. The proposed coordination method helps switches in the distributed local power committees to reach a consensus among many proposed service restoration solutions after faults are detected and isolated. We also take the voltage violations into consideration in the search of solutions. Two examples of different power distribution systems are presented to demonstrate how the algorithms of the coordination method can identify the best restoration solution among many proposed local candidate solutions. The simulation results show that the proposed committee-based multi-agent approach yields better performance than the previous methods. [ABSTRACT FROM AUTHOR]

We focus on the control and the synthesis of secure timed systems which are modelled as timed automata. The security property that the system must satisfy is anon-interferenceproperty. Intuitively, non-interference ensures the absence of any causal dependency from a high-level domain to a lower level domain. Various notions of non-interference have been defined in the literature, and in this paper, we focus onstrong non-deterministic non-interference(SNNI) and two (bi)simulation-based variants thereof (cosimulation-based SNNI and bisimulation-based SNNI). These properties and their extensions have been mostly studied in the context of discrete event systems, while it is now well-known that time is an important attack vector against secure systems. At the same time, there is an obvious interest in going beyond simple verification to control problems: to be able to automatically make systems secure. We consider non-interference properties in the challenging setting of control of dense-time systems specified bytimed automataand we study the two following problems: (1) check whether it is possible to find a sub-system so that it is non-interferent; if yes, (2) compute a (largest) sub-system which is non-interferent. We exhibit decidable sub-classes for these problems, assess their theoretical complexities and provide effective algorithms based on the classical framework of timed games. [ABSTRACT FROM AUTHOR]

This paper deals with the computational modeling and numerical simulation of contact problems at finite deformations using the finite element method. Quasi-static and dynamic problems are considered and two particular frictional conditions, full stick friction and frictionless cases, are addressed. Lagrange multipliers and regularized formulations of the contact problem, such as penalty or augmented Lagrangian methods, are avoided and a new direct elimination method is proposed. Conserving algorithms are also introduced for the proposed formulation for dynamic contact problems. An assessment of the performance of the resulting formulation is shown in a number of selected benchmark tests and numerical examples, including both quasi-static and dynamic contact problems under full stick friction and frictionless contact conditions. Conservation of key discrete properties exhibited by the time stepping algorithm used for dynamic contact problems is also shown in an example. [ABSTRACT FROM AUTHOR]

L 1 regularization and L p regularization are proposed for processing recovered images based on compressed sensing (CS). L 1 regularization can be solved as a convex optimization problem but is less sparse than L p (0 < p < 1). L p regularization is sparser than L 1 regularization but is more difficult to solve. This paper proposes joint L 1 / L p (0 < p < 1) regularization, which combines L p regularization and L 1 regularization. This joint regularization is applied to recover video of remote sensing based on CS. Joint regularization is sparser than L 1 regularization but is as easy to solve as L 1 regularization. A linearized Bregman reweighted iteration algorithm is proposed to solve the joint L 1 / L p regularization problem. The performance and capabilities of the linearized Bregman algorithm and linearized Bregman reweighted algorithm for solving the joint L 1 / L p regularization model are analyzed and compared through numerical simulations. [ABSTRACT FROM AUTHOR]

Coupling sensors in a sensor network with mobility mechanism can boost the performance of wireless sensor networks (WSNs). In this paper, we address the problem of self-deploying mobile sensors to reach high coverage. The problem is modeled as a multi-objective optimization that simultaneously minimizes two contradictory parameters; the total sensor moving distance and the total uncovered area. In order to resolve the aforementioned deployment problem, this study investigates the use of biologically inspired mechanisms, including evolutionary algorithms and swarm intelligence, with their state-of-the-art algorithms. Unlike most of the existing works, the coverage parameter is expressed as a probabilistic inference model due to uncertainty in sensor readings. To the best of our knowledge, probabilistic coverage of mobile sensor networks has not been addressed in the context of multi-objective bio-inspired algorithms. Performance evaluations on deployment quality and deployment cost are measured and analyzed through extensive simulations, showing the effectiveness of each algorithm under the developed objective functions. Simulations reveal that only one multi-objective evolutionary algorithm; the so-called multi-objective evolutionary algorithm with decomposition survives to effectively tackle the probabilistic coverage deployment problem. It gathers more than 78 % signals from all of the targets (and in some cases reaches 100 % certainty). On the other hand, non-dominated sorting genetic algorithm II, multi-objective particle swarm optimization, and non-dominated sorting particle swarm optimization show inferior performance down to 16-32 %, necessitating further modifications in their internal mechanisms. [ABSTRACT FROM AUTHOR]

In this paper, a novel protection of coordinating optimization algorithm is proposed. Maximizing the penetration's dispersed generation and at the same time minimizing the fuse's operating time are the targets. A novel optimization technique, the Imperialistic Competition Algorithm (ICA), is applied to solve the problem. The results of simulations confirm that the proposed method leads to lower operating times of protective devices and higher possible DG penetration, compared with the traditional coordination techniques. [ABSTRACT FROM AUTHOR]

By using the differential evolution algorithm (DE) to solve multi-objective optimization problems, this paper proposed a Pareto optimal solution migration based differential evolution for multi-objective optimization (PSDEMO) to guarantee the diversity of Pareto optimal solution. It adopted the elitist strategy in the algorithm, and archived Pareto non-dominance solutions found in the evolution operation dynamically with the evolution process. In addition, it used all the non-dominance solutions in the archive to do migration operation after mutation and crossover operation of DE to increase the number and quality of non-dominated solutions. Compared with standard DE, simulation results show that the PSDEMO not only helps to improve the quantity of the Pareto non-dominance solution, but also has good balance keeping ability between the diversity and convergence. [ABSTRACT FROM AUTHOR]

In biological systems, the dynamic analysis method has gained increasing attention in the past decade. The Boolean network is the most common model of a genetic regulatory network. The interactions of activation and inhibition in the genetic regulatory network are modeled as a set of functions of the Boolean network, while the state transitions in the Boolean network reflect the dynamic property of a genetic regulatory network. A difficult problem for state transition analysis is the finding of attractors. In this paper, we modeled the genetic regulatory network as a Boolean network and proposed a solving algorithm to tackle the attractor finding problem. In the proposed algorithm, we partitioned the Boolean network into several blocks consisting of the strongly connected components according to their gradients, and defined the connection between blocks as decision node. Based on the solutions calculated on the decision nodes and using a satisfiability solving algorithm, we identified the attractors in the state transition graph of each block. The proposed algorithm is benchmarked on a variety of genetic regulatory networks. Compared with existing algorithms, it achieved similar performance on small test cases, and outperformed it on larger and more complex ones, which happens to be the trend of the modern genetic regulatory network. Furthermore, while the existing satisfiability-based algorithms cannot be parallelized due to their inherent algorithm design, the proposed algorithm exhibits a good scalability on parallel computing architectures. [ABSTRACT FROM AUTHOR]

Abstract: In this paper, the problem of clustering based procedure for the identification of PieceWise Auto-Regressive eXogenous (PWARX) models is addressed. This problem involves both the estimation of the parameters of the affine sub-models and the hyperplanes defining the partitions of the state-input regression. In fact, we propose the use of the Chiu's clustering algorithm in order to overcome the main drawbacks of the existing methods which are the poor initialization and the presence of outliers. In addition, our approach is able to generate automatically the number of sub-models. Simulation results are presented to illustrate the performance of the proposed method. An application of the developed approach to an olive oil esterification reactor is also suggested in order to validate simulation results. [Copyright &y& Elsevier]

Birandom portfolio selection problems have been well developed and widely applied in recent years. To solve these problems better, this paper designs a new hybrid intelligent algorithm which combines the improved LGMS-FOA algorithm with birandom simulation. Since all the existing algorithms solving these problems are based on genetic algorithm and birandom simulation, some comparisons between the new hybrid intelligent algorithm and the existing algorithms are given in terms of numerical experiments, which demonstrate that the new hybrid intelligent algorithm is more effective and precise when the numbers of the objective function computations are the same. [ABSTRACT FROM AUTHOR]

The aim of this paper is to analyze load-carrying capacity of redundant free-floating space manipulators (FFSM) in trajectory tracking task. Combined with the analysis of influential factors in load-carrying process, evaluation of maximum load-carrying capacity (MLCC) is described as multiconstrained nonlinear programming problem. An efficient algorithm based on repeated line search within discontinuous feasible region is presented to determine MLCC for a given trajectory of the end-effector and corresponding joint path. Then, considering the influence of MLCC caused by different initial configurations for the starting point of given trajectory, a kind of maximum payload initial configuration planning method is proposed by using PSO algorithm. Simulations are performed for a particular trajectory tracking task of the 7-DOF space manipulator, of which MLCC is evaluated quantitatively. By in-depth research of the simulation results, significant gap between the values of MLCC when using different initial configurations is analyzed, and the discontinuity of allowable load-carrying capacity is illustrated. The proposed analytical method can be taken as theoretical foundation of feasibility analysis, trajectory optimization, and optimal control of trajectory tracking task in on-orbit load-carrying operations. [ABSTRACT FROM AUTHOR]

LAVs (loitering air vehicles) are advanced weapon systems that can loiter autonomously over a target area, detect and acquire the targets, and then attack them. In this paper, by the theory of Itô stochastic differential, a group systemwas analyzed. The uniqueness and continuity of the solution of the system was discussed. Afterwards the model of the system based on the state transition was establishedwith the finite statemachine automatically. At last, a search algorithmwas proposed for obtaining good feasible solutions for problems. And simulation results show that model and method are effective for dealing with cooperative combat of group LAVs. [ABSTRACT FROM AUTHOR]

Abstract: In this paper, finite-time position consensus and collision avoidance problems are investigated for multi-AUV (autonomous underwater vehicle) systems. First, based on the homogeneous control method, finite-time position consensus algorithms are proposed for both leaderless and leader–follower multi-AUV systems without considering collisions between the AUVs. Specifically, in the leader–follower case, a novel distributed finite-time observer is developed for the followers to estimate the leader’s velocity. Second, by constructing collision avoidance and connectivity maintenance functions, modified consensus algorithms containing corresponding gradient terms are presented for multi-AUV systems of both cases, which guarantee collision avoidance, connectivity maintenance, velocity matching, and consensus boundedness. Simulations demonstrate the effectiveness of the proposed control algorithms. [Copyright &y& Elsevier]

Abstract: This paper investigates a flocking problem of multiple agents with heterogeneous nonlinear dynamics. In order to avoid fragmentation, we construct a potential function and a connectivity-preserving flocking algorithm to enable the multiple agents to move with the same velocity while preserving the connectivity of underlying networks with a mild assumption that the initial network is connected and the coupling strength of the initial network of the nonlinear velocity consensus term is larger than a threshold value. Furthermore the proposed flocking algorithm is extended to solve the problem of multi-agent systems with a nonlinear dynamical virtual leader. The result is that all agents' velocities asymptotically approach to the velocity of the virtual leader, and the distance between any two agents is asymptotically stabilized to avoid collisions among agents. Finally, some numerical simulations are presented to illustrate the effectiveness of the theoretical results. [Copyright &y& Elsevier]

Abstract: This paper proposes an optimization-based model for generic document summarization. The model generates a summary by extracting salient sentences from documents. This approach uses the sentence-to-document collection, the summary-to-document collection and the sentence-to-sentence relations to select salient sentences from given document collection and reduce redundancy in the summary. To solve the optimization problem has been created an improved differential evolution algorithm. The algorithm can adjust crossover rate adaptively according to the fitness of individuals. We implemented the proposed model on multi-document summarization task. Experiments have been performed on DUC2002 and DUC2004 data sets. The experimental results provide strong evidence that the proposed optimization-based approach is a viable method for document summarization. [Copyright &y& Elsevier]

In this paper the problem of patrolling an environment with a dynamic team of robots is targeted. Lately, the interest of the research community has been focused in the development of patrol strategies; however there is a deficit of studies comparing such strategies, namely in terms of their performance and team scalability in different environments. For this reason, an evaluation of five representative patrol approaches is presented in this article. Aiming to analyze the performance, ability to scale and the behavior resulting from interactions between teammates, extensive realistic simulation using ROS together with Stage was conducted. The metric used to compare the performance is the average idleness of the topological environment (i.e. graph), that represents the area to patrol. The results presented help to identify which strategies enable enhanced team scalability and which are the most suitable approaches given any environment, supporting future research directions in the field. [ABSTRACT FROM PUBLISHER]

Abstract: The maximal covering location problem (MCLP) seeks location of facilities on a network, so as to maximize the total demand within a pre-defined distance or travel time of facilities (which is called coverage radius). Most of the real-world applications of MCLP comprise many demand nodes to be covered. Moreover, uncertainty is ubiquitous in most of the real-world covering location problems, which are solved for a long-term horizon. Therefore, this paper studies a large-scale MCLP on the plane with fuzzy coverage radii under the Hurwicz criterion. In order to solve the problem, a combination of variable neighborhood search (VNS) and fuzzy simulation is offered. Test problems with up to 2500 nodes and different settings show that VNS is competitive, since it is able to find solutions with gaps all below 1.5% in much less time compared to exact algorithms. [Copyright &y& Elsevier]

In this paper, the joint transceiver design issue is investigated for multi-cell systems with multiple mobile terminals (MTs). An optimization problem is formulated based on the criterion of mean squared error minimization for the joint design of the cooperative precoder of all multi-input multi-output (MIMO) cells and the cooperative decoder of all MIMO MTs. With a fixed decoder, the optimum precoder is first derived in a closed-form expression, where no exchange of data streams among all of the MIMO cells is required due to the limited capability of the backhaul. Subsequently, an optimum decoder is then obtained in an analytical expression with the fixed precoder. Based on these two expressions, an iterative algorithm with guaranteed convergence is finally developed to carry out the joint optimization of the cooperative precoders and decoders. Simulation results demonstrating the effectiveness of the proposed algorithm are also provided. [ABSTRACT FROM AUTHOR]

Abstract: This paper presents a multi-robot simultaneous localization and map building (SLAM) algorithm, suitable for environments which can be represented in terms of lines and segments. Linear features are described by adopting the recently introduced -Space representation, which provides a unified framework for the parameterization of different kinds of features. The proposed solution to the cooperative SLAM problem is split into three phases. Initially, each robot solves the SLAM problem independently. When two robots meet, their local maps are merged together using robot-to-robot relative range and bearing measurements. Then, each robot starts over with the single-robot SLAM algorithm, by exploiting the merged map. The proposed map fusion technique is specifically tailored to the adopted feature representation, and takes into account explicitly the uncertainty affecting both the maps and the robot mutual measurements. Numerical simulations and experiments with a team composed of two robots performing SLAM in a real-world scenario, are presented to evaluate the effectiveness of the proposed approach. [Copyright &y& Elsevier]

The harmony search (HS) method is a popular meta-heuristic optimization algorithm, which has been extensively employed to handle various engineering problems. However, it sometimes fails to offer a satisfactory convergence performance under certain circumstances. In this paper, we propose and study a hybrid HS approach, HS-PBIL, by merging the HS together with the population-based incremental learning (PBIL). Numerical simulations demonstrate that our HS-PBIL is well capable of outperforming the regular HS method in dealing with nonlinear function optimization and a practical wind generator optimization problem. [ABSTRACT FROM AUTHOR]