Contents  Introduction  Image Collection planning system  Optimized Satellite Planning System for Multi-Satellite Operation  Optimization.

Slides:



Advertisements
Similar presentations
MSS S i Half Reply Other MSSs ACCEPT OR REJECT MH H i NEWTKT REQUESTACK ACKs ART Start ART End AWT Start AWT End.
Advertisements

1/22 Worst and Best-Case Coverage in Sensor Networks Seapahn Meguerdichian, Farinaz Koushanfar, Miodrag Potkonjak, and Mani Srivastava IEEE TRANSACTIONS.
Hadi Goudarzi and Massoud Pedram
Summary of complementary slackness: 1. If x i ≠ 0, i= 1, 2, …, n the ith dual equation is tight. 2. If equation i of the primal is not tight, y i =0. 1.
1 EE5900 Advanced Embedded System For Smart Infrastructure RMS and EDF Scheduling.
Classical Planning via Plan-space search COMP3431 Malcolm Ryan.
Bag-of-Tasks Scheduling under Budget Constraints Ana-Maria Oprescu, Thilo Kielman Presented by Bryan Rosander.
Mauro Sozio and Aristides Gionis Presented By:
RUN: Optimal Multiprocessor Real-Time Scheduling via Reduction to Uniprocessor Paul Regnier † George Lima † Ernesto Massa † Greg Levin ‡ Scott Brandt ‡
1 Sensor Relocation in Mobile Sensor Networks Guiling Wang, Guohong Cao, Tom La Porta, and Wensheng Zhang Department of Computer Science & Engineering.
Date:2011/06/08 吳昕澧 BOA: The Bayesian Optimization Algorithm.
1 Data Persistence in Large-scale Sensor Networks with Decentralized Fountain Codes Yunfeng Lin, Ben Liang, Baochun Li INFOCOM 2007.
MAE 552 – Heuristic Optimization Lecture 8 February 8, 2002.
CS541 Advanced Networking 1 Spectrum Sharing in Cognitive Radio Networks Neil Tang 3/23/2009.
A Performance Analysis of Fixed and Dynamic Channel Allocation Schemes in Cellular Networks Author Muhammad Emran Co-authors Syed Asad Hussain, Saqib Hussain.
Economics 214 Lecture 39 Constrained Optimization.
Branch and Bound Algorithm for Solving Integer Linear Programming
On the Task Assignment Problem : Two New Efficient Heuristic Algorithms.
Distributed Scheduling. What is Distributed Scheduling? Scheduling: –A resource allocation problem –Often very complex set of constraints –Tied directly.
Scheduling Parallel Task
Introduction to Data Mining Engineering Group in ACL.
Learning Table Extraction from Examples Ashwin Tengli, Yiming Yang and Nian Li Ma School of Computer Science Carnegie Mellon University Coling 04.
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
Article Title: Optimization model for resource assignment problems of linear construction projects ShuShun Liu & ChangJung Wang, National Yunlin University.
DEXA 2005 Quality-Aware Replication of Multimedia Data Yicheng Tu, Jingfeng Yan and Sunil Prabhakar Department of Computer Sciences, Purdue University.
HOW TO SOLVE IT? Algorithms. An Algorithm An algorithm is any well-defined (computational) procedure that takes some value, or set of values, as input.
Avalanche Internet Data Management System. Presentation plan 1. The problem to be solved 2. Description of the software needed 3. The solution 4. Avalanche.
Process Flowsheet Generation & Design Through a Group Contribution Approach Lo ï c d ’ Anterroches CAPEC Friday Morning Seminar, Spring 2005.
CHP-4 QUEUE.
WEMAREC: Accurate and Scalable Recommendation through Weighted and Ensemble Matrix Approximation Chao Chen ⨳ , Dongsheng Li
Mehdi Kargar Aijun An York University, Toronto, Canada Discovering Top-k Teams of Experts with/without a Leader in Social Networks.
Mehdi Kargar Aijun An York University, Toronto, Canada Keyword Search in Graphs: Finding r-cliques.
Methodology in Research Md Yazid Mohd Saman Date: 01-Sep-15.
An algorithm for a Parallel Machine Problem with Eligibility and Release and Delivery times, considering setup times Manuel Mateo Management.
Chapter 12 Recursion, Complexity, and Searching and Sorting
An Architecture for Distributed High Performance Video Processing in the Cloud Speaker : 吳靖緯 MA0G IEEE 3rd International Conference.
CS1020 Week 11: 2 nd April Contents  Sit-in Lab #3  Take-home Lab #5 Week 112.
INTERNATIONAL CONFERENCE ON INFORMATION SCIENCE AND TECHNOLOGY, P.P , MARCH An ANFIS-based Dispatching Rule For Complex Fuzzy Job Shop Scheduling.
Traffic Based Pathway Optimization Michael LeGore TJHSST CSL.
The Application of The Improved Hybrid Ant Colony Algorithm in Vehicle Routing Optimization Problem International Conference on Future Computer and Communication,
Mehdi Kargar Aijun An York University, Toronto, Canada Keyword Search in Graphs: Finding r-cliques.
Job scheduling algorithm based on Berger model in cloud environment Advances in Engineering Software (2011) Baomin Xu,Chunyan Zhao,Enzhao Hua,Bin Hu 2013/1/251.
Object-Oriented Design and Implementation of the OE-Scheduler in Real-time Environments Ilhyun Lee Cherry K. Owen Haesun K. Lee The University of Texas.
Service-oriented Resource Broker for QoS-Guaranteed in Grid Computing System Yichao Yang, Jin Wu, Lei Lang, Yanbo Zhou and Zhili Sun Centre for communication.
CS201: Data Structures and Discrete Mathematics I Hash Table.
Parallelizing Video Transcoding Using Map-Reduce-Based Cloud Computing Speaker : 童耀民 MA1G0222 Feng Lao, Xinggong Zhang and Zongming Guo Institute of Computer.
O PTIMAL SERVICE TASK PARTITION AND DISTRIBUTION IN GRID SYSTEM WITH STAR TOPOLOGY G REGORY L EVITIN, Y UAN -S HUN D AI Adviser: Frank, Yeong-Sung Lin.
Computing Simulation in Orders Based Transparent Parallelizing Pavlenko Vitaliy Danilovich, Odessa National Polytechnic University Burdeinyi Viktor Viktorovych,
Content caching and scheduling in wireless networks with elastic and inelastic traffic Group-VI 09CS CS CS30020 Performance Modelling in Computer.
Software Engineering Issues Software Engineering Concepts System Specifications Procedural Design Object-Oriented Design System Testing.
Branch and Bound Algorithms Present by Tina Yang Qianmei Feng.
CSCI1600: Embedded and Real Time Software Lecture 23: Real Time Scheduling I Steven Reiss, Fall 2015.
Outline Problem Definition Related Works & Complexity MILP Formulation Solution Algorithms Computational Experiments Conclusions & Future Research 1/26.
Distributed Pattern Recognition System, Web-based by Nadeem Ahmed.
Identifying the Missing Tags in a Large RFID System Tao Li (University of Florida, US) Shigang Chen (University of Florida, US) Yibei Ling (Telcordia Technologies,
A Bandwidth Scheduling Algorithm Based on Minimum Interference Traffic in Mesh Mode Xu-Yajing, Li-ZhiTao, Zhong-XiuFang and Xu-HuiMin International Conference.
Production Scheduling Lorena Kawas lk2551 Raul Galindo rg2802.
10 1 Chapter 10 - A Transaction Management Database Systems: Design, Implementation, and Management, Rob and Coronel.
Fair and Efficient multihop Scheduling Algorithm for IEEE BWA Systems Daehyon Kim and Aura Ganz International Conference on Broadband Networks 2005.
An Exact Algorithm for Difficult Detailed Routing Problems Kolja Sulimma Wolfgang Kunz J. W.-Goethe Universität Frankfurt.
Parameter Reduction for Density-based Clustering on Large Data Sets Elizabeth Wang.
CS 206 Introduction to Computer Science II 04 / 08 / 2009 Instructor: Michael Eckmann.
Distributed Control and Autonomous Systems Lab. Sang-Hyuk Yun and Hyo-Sung Ahn Distributed Control and Autonomous Systems Laboratory (DCASL ) Department.
Journal of Computational and Applied Mathematics Volume 253, 1 December 2013, Pages 14–25 Reporter : Zong-Dian Lee A hybrid quantum inspired harmony search.
Limited-Preemption Scheduling of Sporadic Tasks Systems
Interpret the execution mode of SQL query in F1 Query paper
Figure 7.1 Some queue operations. Figure 7.1 Some queue operations.
Title of Study Presenter names Major department names
Presented By: Darlene Banta
Mr. M. D. Jamadar Assistant Professor
Presentation transcript:

Contents  Introduction  Image Collection planning system  Optimized Satellite Planning System for Multi-Satellite Operation  Optimization Algorithm Design  Conclusion

 Operation of satellite image ① User request ② Image collection planning ③ Product generation ④ Distribution Introduction Figure 1. Operation Procedure for KOMPSAT-2

Image collection planning  Job scheduling of satellite  To maximize satellite resources with NTO (New Task Order) and unfinished order from user request within several constraints  Many parameters are considered in image collection planning  Image collection planning: complexity  KARI is expected to operate several satellites  Image collection planning should be optimized for multi-satellite.  Optimized image collection planning is already researched. But the optimized satellit e planning system is able to be applied to several satellite separately (or partially) not multi-satellite operations  In this paper, feasibility of efficiency improvement of optimized satellite planning system at present is investigated for image collection planning for multi-satellite. Introduction

Image Collection Planning 1.NTO(New Task Order): Order Database 2.Simulated scene generation 3.Pre-Processing with simulated scene, weather Information and satellite constraints 4.Optimization with all possible segments 5.Scheduling with optimized possible segments Simulated Scene Generation Optimization NTO Order Database Pre-Processing Scheduling orders Simulated Scene All Possible Segments Optimized Possible Segments Inactivated segments Weather Info. Satellite Constraints

Optimized Image Collection Planning  Assumption: Multi-satellite operation (SAT1 & SAT2)  For orders of undesignated satellite  First, image collection planning for SAT1 in order with undesignated satellite and order with designated SAT1  Next, image collection planning for SAT2 in the result from SAT1, order with undesignated satellite and order with designated SAT2  But processing of optimized satellite planning system is optimized for each SAT1 and SAT2

Optimized Image Collection Planning  Assumption: Multi-satellite operation (SAT1 & SAT2)  For orders of undesignated satellite  First optimization: each SAT1 and SAT2  Second optimization optimized SAT1 result and optimized SAT2 result if there is collision with optimized SAT1 result and optimized SAT2 result for order with undesi gnated satellite, optimization algorithm is performed to solve the collision. And it is necessary to make simulated scene number table for order undesignated satellite to solve the collision

Optimization Algorithm Design  Heuristic Algorithm: Deletion  Assumption: all segments are scheduled  Delete a segment from schedule until segment meets satellite constraints. All segments are scheduled Find a best segment (least decrement) Delete a segment from schedule No Yes Feasibility check Terminate

Optimization Algorithm Design  Heuristic Algorithm: Insertion  Assumption: no segment is scheduled (empty schedule)  Insert a segment in the schedule until segment is added to schedule no more. Empty schedule Find a best segment (maximize objective function) Insert a segment in the schedule No Yes Checked all segments? Terminate

Conclusion  Improved design of optimized satellite planning system  Two step optimization  Simulated scene number table  Will be expected to develop and implement system for multi-operation  If optimized satellite planning system is used in multi-satellite operation, it lowers human resources, computational time and can process more o rder from user rapidly.

Q&A