O-MOORE-NICE!: new methodologies and algorithms for design and simulation of analog integrated circuits

No abstract

Embedding Graphs under Centrality Constraints for Network Visualization

Visual rendering of graphs is a key task in the mapping of complex network data. Although most graph drawing algorithms emphasize aesthetic appeal, certain applications such as travel-time maps place more importance on visualization of structural network properties. The present paper advocates two graph embedding approaches with centrality considerations to comply with node hierarchy. The problem is formulated first as one of constrained multi-dimensional scaling (MDS), and it is solved via block coordinate descent iterations with successive approximations and guaranteed convergence to a KKT point. In addition, a regularization term enforcing graph smoothness is incorporated with the goal of reducing edge crossings. A second approach leverages the locally-linear embedding (LLE) algorithm which assumes that the graph encodes data sampled from a low-dimensional manifold. Closed-form solutions to the resulting centrality-constrained optimization problems are determined yielding meaningful embeddings. Experimental results demonstrate the efficacy of both approaches, especially for visualizing large networks on the order of thousands of nodes.Comment: Submitted to IEEE Transactions on Visualization and Computer Graphic

Optimal Trajectory Tracking for an Autonomous UAV

The aim of the present project is the design of optimal flight trajectories for an automomous aerial vehicle which is expected to reach the desired locations in the operational environment expressed in terms of planned waypoints. The navigation must be performed with the vehicle's best effort, i.e. with the lowest cost. Hence, we want to minimize the input energy, a function of the inputs for the mathematical model which describes the dynamics of the vehicle. The trajectory must satisfy all the constraints and pass through all the planned waypoints. Assuming the vehicle as a point mass model, the best solution has been investigated through a genetic algorithm search procedure. The optimisation problem has been solved by modifying a micro-genetic algorithm software which was initially developed by D.L. Carroll. Between all the possible trajectories we select the more "realistic" connections among the waypoints. First of all, we have left out the trajectories with discontinuity in the derivatives as these are not feasible by the real aircraft. The polynomial spline is a suitable candidate to solve our problem. The algorithm splits the trajectory in sub-trajectories which join a sequence of three waypoints. Starting from the first three waypoints, the following sub-trajectories are superimposed keeping the first waypoint coincident with the last of the previous sub-trajectory. The sequence of polynomials is initialized assuming that jumps in the direction of flight are avoided pointing the heading angle in the presumed direction of flight. The optimal trajectory is a trade-off amongst three factors: the required energy cost, the minimum distance from the required waypoint and the feasibility of the trajectory. Results obtained with this optimization procedure are presente

Autonomous Drone Racing with Deep Reinforcement Learning

In many robotic tasks, such as drone racing, the goal is to travel through a set of waypoints as fast as possible. A key challenge for this task is planning the minimum-time trajectory, which is typically solved by assuming perfect knowledge of the waypoints to pass in advance. The resulting solutions are either highly specialized for a single-track layout, or suboptimal due to simplifying assumptions about the platform dynamics. In this work, a new approach to minimum-time trajectory generation for quadrotors is presented. Leveraging deep reinforcement learning and relative gate observations, this approach can adaptively compute near-time-optimal trajectories for random track layouts. Our method exhibits a significant computational advantage over approaches based on trajectory optimization for non-trivial track configurations. The proposed approach is evaluated on a set of race tracks in simulation and the real world, achieving speeds of up to 17 m/s with a physical quadrotor

An optimization framework for wind farm layout design using CFD-based Kriging model

Wind farm layout optimization (WFLO) seeks to alleviate the wake loss and maximize wind farm power output efficiency, and is a crucial process in the design of wind energy projects.Since the optimization algorithms typically require thousands of numerical evaluations of the wake effects, conventional WFLO studies are usually carried out with the low-fidelity analytical wake models.In this paper, we develop an optimization framework for wind farm layout design using CFD-based Kriging model to maximize the annual energy production (AEP) of wind farms. This surrogate-based optimization (SBO) framework uses latin hypercube sampling to generate a group of wind farm layout samples, based on which CFD simulations are carried out to obtain the corresponding AEPs.This wind farm layout dataset is used to train the Kriging model, which is then integrated with an optimizer based on genetic algorithm (GA). As the optimization progresses, the intermediate optimal layout designs are again fed into the dataset.Such adaptive update of wind farm layout dataset continues until the algorithm converges.To evaluate the performance of the proposed SBO framework, we apply it to three representative wind farm cases.Compared to the conventional staggered layout, the optimized wind farm produces significantly higher total AEP.In particular, the SBO framework requires significantly smaller number of CFD calls to yield the optimal layouts that generates almost the same AEP with the direct CFD-GA method.Further analysis on the velocity fields show that the optimization framework attempts to locate the downstream turbines away from the the wakes of upstream ones.The proposed CFD-based surrogate model provides a more accurate and flexible alternative to the conventional analytical-wake-model-based methods in WFLO tasks, and has the potential to be used for designing efficient wind farm projects