ENHANCED SEEKER OPTIMIZATION ALGORITHM FOR REDUCTION OF ACTIVE POWER LOSS

This paper projects Enhanced Seeker Optimization (ESO) algorithm for solving optimal reactive power problem. Seeker optimization algorithm (SOA) models the deeds of human search population based on their memory, experience, uncertainty reasoning and communication with each other. In Artificial Bee Colony (ABC) algorithm the colony consists of three groups of bees: employed bees, onlookers and scouts. All bees that are presently exploiting a food source are known as employed bees. The number of the employed bees is equal to the number of food sources and an employed bee is allocated to one of the sources. In this paper hybridization of the seeker optimization algorithm with artificial bee colony (ABC) algorithm has been done to solve the optimal reactive power problem. Enhanced Seeker Optimization (ESO) algorithm combines two different solution exploration equations of the ABC algorithm and solution exploration equation of the SOA in order to progress the performance of SOA and ABC algorithms. At certain period’s seeker’s location are modified by search principles obtained from the ABC algorithm, also it adjust the inter-subpopulation learning phase by using the binomial crossover operator. In order to evaluate the efficiency of proposed Enhanced Seeker Optimization (ESO) algorithm it has been tested in standard IEEE 57,118 bus systems and compared to other specified algorithms. Simulation results clearly indicate the best performance of the proposed Enhanced Seeker Optimization (ESO) algorithm in reducing the real power loss and voltage profiles are within the limits

Particle Swarm Optimization Based Source Seeking

Signal source seeking using autonomous vehicles is a complex problem. The complexity increases manifold when signal intensities captured by physical sensors onboard are noisy and unreliable. Added to the fact that signal strength decays with distance, noisy environments make it extremely difficult to describe and model a decay function. This paper addresses our work with seeking maximum signal strength in a continuous electromagnetic signal source with mobile robots, using Particle Swarm Optimization (PSO). A one to one correspondence with swarm members in a PSO and physical Mobile robots is established and the positions of the robots are iteratively updated as the PSO algorithm proceeds forward. Since physical robots are responsive to swarm position updates, modifications were required to implement the interaction between real robots and the PSO algorithm. The development of modifications necessary to implement PSO on mobile robots, and strategies to adapt to real life environments such as obstacles and collision objects are presented in this paper. Our findings are also validated using experimental testbeds.Comment: 13 pages, 12 figure

Short-term Self-Scheduling of Virtual Energy Hub Plant within Thermal Energy Market

Multicarrier energy systems create new challenges as well as opportunities in future energy systems. One of these challenges is the interaction among multiple energy systems and energy hubs in different energy markets. By the advent of the local thermal energy market in many countries, energy hubs' scheduling becomes more prominent. In this article, a new approach to energy hubs' scheduling is offered, called virtual energy hub (VEH). The proposed concept of the energy hub, which is named as the VEH in this article, is referred to as an architecture based on the energy hub concept beside the proposed self-scheduling approach. The VEH is operated based on the different energy carriers and facilities as well as maximizes its revenue by participating in the various local energy markets. The proposed VEH optimizes its revenue from participating in the electrical and thermal energy markets and by examining both local markets. Participation of a player in the energy markets by using the integrated point of view can be reached to a higher benefit and optimal operation of the facilities in comparison with independent energy systems. In a competitive energy market, a VEH optimizes its self-scheduling problem in order to maximize its benefit considering uncertainties related to renewable resources. To handle the problem under uncertainty, a nonprobabilistic information gap method is implemented in this study. The proposed model enables the VEH to pursue two different strategies concerning uncertainties, namely risk-averse strategy and risk-seeker strategy. For effective participation of the renewable-based VEH plant in the local energy market, a compressed air energy storage unit is used as a solution for the volatility of the wind power generation. Finally, the proposed model is applied to a test case, and the numerical results validate the proposed approach

Fairness of Exposure in Rankings

Rankings are ubiquitous in the online world today. As we have transitioned from finding books in libraries to ranking products, jobs, job applicants, opinions and potential romantic partners, there is a substantial precedent that ranking systems have a responsibility not only to their users but also to the items being ranked. To address these often conflicting responsibilities, we propose a conceptual and computational framework that allows the formulation of fairness constraints on rankings in terms of exposure allocation. As part of this framework, we develop efficient algorithms for finding rankings that maximize the utility for the user while provably satisfying a specifiable notion of fairness. Since fairness goals can be application specific, we show how a broad range of fairness constraints can be implemented using our framework, including forms of demographic parity, disparate treatment, and disparate impact constraints. We illustrate the effect of these constraints by providing empirical results on two ranking problems.Comment: In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, London, UK, 201

Stereo Matching in Address-Event-Representation (AER) Bio-Inspired Binocular Systems in a Field-Programmable Gate Array (FPGA)

In stereo-vision processing, the image-matching step is essential for results, although it involves a very high computational cost. Moreover, the more information is processed, the more time is spent by the matching algorithm, and the more ine cient it is. Spike-based processing is a relatively new approach that implements processing methods by manipulating spikes one by one at the time they are transmitted, like a human brain. The mammal nervous system can solve much more complex problems, such as visual recognition by manipulating neuron spikes. The spike-based philosophy for visual information processing based on the neuro-inspired address-event-representation (AER) is currently achieving very high performance. The aim of this work was to study the viability of a matching mechanism in stereo-vision systems, using AER codification and its implementation in a field-programmable gate array (FPGA). Some studies have been done before in an AER system with monitored data using a computer; however, this kind of mechanism has not been implemented directly on hardware. To this end, an epipolar geometry basis applied to AER systems was studied and implemented, with other restrictions, in order to achieve good results in a real-time scenario. The results and conclusions are shown, and the viability of its implementation is proven.Ministerio de Economía y Competitividad TEC2016-77785-