Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Uncertainty (3)
- Lagrangian Relaxation (2)
- Multi-Agent Systems (2)
- 802.11 (1)
- Adaptive maintenance advisor (1)
-
- Adaptive resonance theory (1)
- Agent-based model (1)
- Air indices (1)
- AoA (1)
- ArrayTrack (1)
- Artificial Intelligence (1)
- Auction (1)
- Autonomous Learning 2012 (1)
- Autonomous trading (1)
- Bid pricing behavior (1)
- Celebrity videos (1)
- Census (1)
- Commodity trading (1)
- Community analysis (1)
- Computer Science (1)
- Continuous activity recognition (1)
- Cross-domain concept learning (1)
- DCOP (1)
- DEC-POMDP (1)
- DPOP (1)
- Database (1)
- De-anonymization (1)
- Delayed Observations (1)
- Domain adaptation (1)
- Energy efficient learning (1)
Articles 1 - 30 of 37
Full-Text Articles in Physical Sciences and Mathematics
Knowledge-Driven Autonomous Commodity Trading Advisor, Yee Pin Lim, Shih-Fen Cheng
Knowledge-Driven Autonomous Commodity Trading Advisor, Yee Pin Lim, Shih-Fen Cheng
Research Collection School Of Computing and Information Systems
The myth that financial trading is an art has been mostly destroyed in the recent decade due to the proliferation of algorithmic trading. In equity markets, algorithmic trading has already bypass human traders in terms of traded volume. This trend seems to be irreversible, and other asset classes are also quickly becoming dominated by the machine traders. However, for asset that requires deeper understanding of physicality, like the trading of commodities, human traders still have significant edge over machines. The primary advantage of human traders in such market is the qualitative expert knowledge that requires traders to consider not just …
Lagrangian Relaxation For Large-Scale Multi-Agent Planning, Geoff Gordon, Pradeep Varakantham, William Yeoh, Hoong Chuin Lau, Shih-Fen Cheng
Lagrangian Relaxation For Large-Scale Multi-Agent Planning, Geoff Gordon, Pradeep Varakantham, William Yeoh, Hoong Chuin Lau, Shih-Fen Cheng
Research Collection School Of Computing and Information Systems
Multi-agent planning is a well-studied problem with various applications including disaster rescue, urban transportation and logistics, both for autonomous agents and for decision support to humans. Due to computational constraints, existing research typically focuses on one of two scenarios: unstructured domains with many agents where we are content with heuristic solutions, or domains with small numbers of agents or special structure where we can provide provably near-optimal solutions. By contrast, in this paper, we focus on providing provably near-optimal solutions for domains with large numbers of agents, by exploiting a common domain-general property: if individual agents each have limited influence …
Lagrangian Relaxation For Large-Scale Multi-Agent Planning, Geoffrey J. Gordon, Pradeep Varakantham, William Yeoh, Hoong Chuin Lau, Ajay S. Aravamudhan, Shih-Fen Cheng
Lagrangian Relaxation For Large-Scale Multi-Agent Planning, Geoffrey J. Gordon, Pradeep Varakantham, William Yeoh, Hoong Chuin Lau, Ajay S. Aravamudhan, Shih-Fen Cheng
Research Collection School Of Computing and Information Systems
Multi-agent planning is a well-studied problem with various applications including disaster rescue, urban transportation and logistics, both for autonomous agents and for decision support to humans. Due to computational constraints, existing research typically focuses on one of two scenarios: unstructured domains with many agents where we are content with heuristic solutions, or domains with small numbers of agents or special structure where we can provide provably near-optimal solutions. By contrast, in this paper, we focus on providing provably near-optimal solutions for domains with large numbers of agents, by exploiting a common domain-general property: if individual agents each have limited influence …
A Mechanism For Organizing Last-Mile Service Using Non-Dedicated Fleet, Shih-Fen Cheng, Duc Thien Nguyen, Hoong Chuin Lau
A Mechanism For Organizing Last-Mile Service Using Non-Dedicated Fleet, Shih-Fen Cheng, Duc Thien Nguyen, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Unprecedented pace of urbanization and rising income levels have fueled the growth of car ownership in almost all newly formed megacities. Such growth has congested the limited road space and significantly affected the quality of life in these megacities. Convincing residents to give up their cars and use public transport is the most effective way in reducing congestion; however, even with sufficient public transport capacity, the lack of last-mile (from the transport hub to the destination) travel services is the major deterrent for the adoption of public transport. Due to the dynamic nature of such travel demands, fixed-size fleets will …
Action Disambiguation Analysis Using Normalized Google-Like Distance Correlogram, Qianru Sun, Hong Liu
Action Disambiguation Analysis Using Normalized Google-Like Distance Correlogram, Qianru Sun, Hong Liu
Research Collection School Of Computing and Information Systems
Classifying realistic human actions in video remains challenging for existing intro-variability and inter-ambiguity in action classes. Recently, Spatial-Temporal Interest Point (STIP) based local features have shown great promise in complex action analysis. However, these methods have the limitation that they typically focus on Bag-of-Words (BoW) algorithm, which can hardly discriminate actions’ ambiguity due to ignoring of spatial-temporal occurrence relations of visual words. In this paper, we propose a new model to capture this contextual relationship in terms of pairwise features’ co-occurrence. Normalized Google-Like Distance (NGLD) is proposed to numerically measuring this co-occurrence, due to its effectiveness in semantic correlation analysis. …
Predicting Domain Adaptivity: Redo Or Recycle?, Ting Yao, Chong-Wah Ngo, Shiai Zhu
Predicting Domain Adaptivity: Redo Or Recycle?, Ting Yao, Chong-Wah Ngo, Shiai Zhu
Research Collection School Of Computing and Information Systems
Over the years, the academic researchers have contributed various visual concept classifiers. Nevertheless, given a new dataset, most researchers still prefer to develop large number of classifiers from scratch despite expensive labeling efforts and limited computing resources. A valid question is why not multimedia community “embrace the green” and recycle off-the-shelf classifiers for new dataset. The difficulty originates from the domain gap that there are many different factors that govern the development of a classifier and eventually drive its performance to emphasize certain aspects of dataset. Reapplying a classifier to an unseen dataset may end up GIGO (garbage in, garbage …
Community As A Connector: Associating Faces With Celebrity Names In Web Videos, Zhineng Chen, Chong-Wah Ngo, Juan Cao, Wei Zhang
Community As A Connector: Associating Faces With Celebrity Names In Web Videos, Zhineng Chen, Chong-Wah Ngo, Juan Cao, Wei Zhang
Research Collection School Of Computing and Information Systems
Associating celebrity faces appearing in videos with their names is of increasingly importance with the popularity of both celebrity videos and related queries. However, the problem is not yet seriously studied in Web video domain. This paper proposes a Community connected Celebrity Name-Face Association approach (CCNFA), where the community is regarded as an intermediate connector to facilitate the association. Specifically, with the names and faces extracted from Web videos, C-CNFA decomposes the association task into a three-step framework: community discovering, community matching and celebrity face tagging. To achieve the goal of efficient name-face association under this umbrella, algorithms such as …
Cognitive Architectures And Autonomy: Commentary And Response, Włodzisław Duch, Ah-Hwee Tan, Stan Franklin
Cognitive Architectures And Autonomy: Commentary And Response, Włodzisław Duch, Ah-Hwee Tan, Stan Franklin
Research Collection School Of Computing and Information Systems
This paper provides a very useful and promising analysis and comparison of current architectures of autonomous intelligent systems acting in real time and specific contexts, with all their constraints. The chosen issue of Cognitive Architectures and Autonomy is really a challenge for AI current projects and future research. I appreciate and endorse not only that challenge but many specific choices and claims; in particular: (i) that “autonomy” is a key concept for general intelligent systems; (ii) that “a core issue in cognitive architecture is the integration of cognitive processes ....”; (iii) the analysis of features and capabilities missing in current …
Fashionask: Pushing Community Answers To Your Fingertips, Wei Zhang, Lei Pang, Chong-Wah Ngo
Fashionask: Pushing Community Answers To Your Fingertips, Wei Zhang, Lei Pang, Chong-Wah Ngo
Research Collection School Of Computing and Information Systems
We demonstrate a multimedia-based question-answering system, named FashionAsk, by allowing users to ask questions referring to pictures snapped by mobile devices. Specifically, instead of asking verbose questions to depict visual instances, direct pictures are provided as part of questions. To answer these multi-modal questions, FashionAsk performs a large-scale instance search to infer the names of instances, and then matches with similar questions from communitycontributed QA websites as answers. The demonstration is conducted on a million-scale dataset of Web images and QA pairs in the domain of fashion products. Asking a multimedia question through FashionAsk can take as short as five …
A Flexible Mixed Integer Programming Framework For Nurse Scheduling, Murphy Choy, Michelle L. F. Cheong
A Flexible Mixed Integer Programming Framework For Nurse Scheduling, Murphy Choy, Michelle L. F. Cheong
Research Collection School Of Computing and Information Systems
In this paper, a nurse-scheduling model is developed using mixed integer programming model. It is deployed to a general care ward to replace and automate the current manual approach for scheduling. The developed model differs from other similar studies in that it optimizes both hospitals requirement as well as nurse preferences by allowing flexibility in the transfer of nurses from different duties. The model also incorporated additional policies which are part of the hospitals requirement but not part of the legislations. Hospitals key primary mission is to ensure continuous ward care service with appropriate number of nursing staffs and the …
Sensor Openflow: Enabling Software-Defined Wireless Sensor Networks, Tie Luo, Hwee-Pink Tan, Tony Q. S. Quek
Sensor Openflow: Enabling Software-Defined Wireless Sensor Networks, Tie Luo, Hwee-Pink Tan, Tony Q. S. Quek
Research Collection School Of Computing and Information Systems
While it has been a belief for over a decade that wireless sensor networks (WSN) are application-specific, we argue that it can lead to resource underutilization and counter-productivity. We also identify two other main problems with WSN: rigidity to policy changes and difficulty to manage. In this paper, we take a radical, yet backward and peer compatible, approach to tackle these problems inherent to WSN. We propose a Software-Defined WSN architecture and address key technical challenges for its core component, Sensor OpenFlow. This work represents the first effort that synergizes software-defined networking and WSN.
A Probabilistic Graphical Model For Topic And Preference Discovery On Social Media, Lu Liu, Feida Zhu, Lei Zhang, Shiqiang Yang
A Probabilistic Graphical Model For Topic And Preference Discovery On Social Media, Lu Liu, Feida Zhu, Lei Zhang, Shiqiang Yang
Research Collection School Of Computing and Information Systems
Many web applications today thrive on offering services for large-scale multimedia data, e.g., Flickr for photos and YouTube for videos. However, these data, while rich in content, are usually sparse in textual descriptive information. For example, a video clip is often associated with only a few tags. Moreover, the textual descriptions are often overly specific to the video content. Such characteristics make it very challenging to discover topics at a satisfactory granularity on this kind of data. In this paper, we propose a generative probabilistic model named Preference-Topic Model (PTM) to introduce the dimension of user preferences to enhance the …
Uncertain Congestion Games With Assorted Human Agent Populations, Asrar Ahmed, Pradeep Reddy Varakantham, Shih-Fen Cheng
Uncertain Congestion Games With Assorted Human Agent Populations, Asrar Ahmed, Pradeep Reddy Varakantham, Shih-Fen Cheng
Research Collection School Of Computing and Information Systems
Congestion games model a wide variety of real-world resource congestion problems, such as selfish network routing, traffic route guidance in congested areas, taxi fleet optimization and crowd movement in busy areas. However, existing research in congestion games assumes: (a) deterministic movement of agents between resources; and (b) perfect rationality (i.e. maximizing their own expected value) of all agents. Such assumptions are not reasonable in dynamic domains where decision support has to be provided to humans. For instance, in optimizing the performance of a taxi fleet serving a city, movement of taxis can be involuntary or nondeterministic (decided by the specific …
Dynamic Stochastic Orienteering Problems For Risk-Aware Applications, Hoong Chuin Lau, William Yeoh, Pradeep Varakantham, Duc Thien Nguyen
Dynamic Stochastic Orienteering Problems For Risk-Aware Applications, Hoong Chuin Lau, William Yeoh, Pradeep Varakantham, Duc Thien Nguyen
Research Collection School Of Computing and Information Systems
Orienteering problems (OPs) are a variant of the well-known prize-collecting traveling salesman problem, where the salesman needs to choose a subset of cities to visit within a given deadline. OPs and their extensions with stochastic travel times (SOPs) have been used to model vehicle routing problems and tourist trip design problems. However, they suffer from two limitations travel times between cities are assumed to be time independent and the route provided is independent of the risk preference (with respect to violating the deadline) of the user. To address these issues, we make the following contributions: We introduce (1) a dynamic …
The Patrol Scheduling Problem, Hoong Chuin Lau, Aldy Gunawan
The Patrol Scheduling Problem, Hoong Chuin Lau, Aldy Gunawan
Research Collection School Of Computing and Information Systems
This paper presents the problem of scheduling security teams to patrol a mass rapid transit rail network of a large urban city. The main objective of patrol scheduling is to deploy security teams to stations at varying time periods of the network subject to rostering as well as security-related constraints. We present a mathematical programming model for this problem. We then discuss the aspect of injecting randomness by varying the start times, the break times for each team as well as the number of visits required for each station according to their reported vulnerability. Finally, we present results for the …
Bidder Behaviors In Repeated B2b Procurement Auctions, Jong Han Park, Jae Kyu Lee, Hoong Chuin Lau
Bidder Behaviors In Repeated B2b Procurement Auctions, Jong Han Park, Jae Kyu Lee, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
B2B auctions play a key role in a firm's procurement process. Even though it is known that repetition is a key characteristic of procurement auctions, traditional auctioneers typically have not put in place a suitable mechanism that supports repetitive auctions effectively. In this paper, we empirically investigate what has taken place in repeated procurement auctions based on real world data from a major outsourcing company of MRO (Maintenance, Repair and Operations) items in Korea. From this empirical study, we discovered the followings. First, we discovered that the repeated bidders contribute majority of all bids, and that the number of new …
Toward Large-Scale Agent Guidance In An Urban Taxi Service, Agussurja Lucas, Hoong Chuin Lau
Toward Large-Scale Agent Guidance In An Urban Taxi Service, Agussurja Lucas, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Empty taxi cruising represents a wastage of resources in the context of urban taxi services. In this work, we seek to minimize such wastage. An analysis of a large trace of taxi operations reveals that the services’ inefficiency is caused by drivers’ greedy cruising behavior. We model the existing system as a continuous time Markov chain. To address the problem, we propose that each taxi be equipped with an intelligent agent that will guide the driver when cruising for passengers. Then, drawing from AI literature on multiagent planning, we explore two possible ways to compute such guidance. The first formulation …
Decision Support For Agent Populations In Uncertain And Congested Environments, Pradeep Reddy Varakantham, Shih-Fen Cheng, Geoff Gordon, Asrar Ahmed
Decision Support For Agent Populations In Uncertain And Congested Environments, Pradeep Reddy Varakantham, Shih-Fen Cheng, Geoff Gordon, Asrar Ahmed
Research Collection School Of Computing and Information Systems
This research is motivated by large scale problems in urban transportation and labor mobility where there is congestion for resources and uncertainty in movement. In such domains, even though the individual agents do not have an identity of their own and do not explicitly interact with other agents, they effect other agents. While there has been much research in handling such implicit effects, it has primarily assumed deterministic movements of agents. We address the issue of decision support for individual agents that are identical and have involuntary movements in dynamic environments. For instance, in a taxi fleet serving a city, …
Logistics Orchestration Modeling And Evaluation For Humanitarian Relief, Hoong Chuin Lau, Zhengping Li, Xin Du, Heng Jiang, Robert De Souza
Logistics Orchestration Modeling And Evaluation For Humanitarian Relief, Hoong Chuin Lau, Zhengping Li, Xin Du, Heng Jiang, Robert De Souza
Research Collection School Of Computing and Information Systems
This paper proposes an orchestration model for post-disaster response that is aimed at automating the coordination of scarce resources that minimizes the loss of human lives. In our setting, different teams are treated as agents and their activities are "orchestrated" to optimize rescue performance. Results from simulation are analysed to evaluate the performance of the optimization model.
Lagrangian Relaxation For Large-Scale Multi-Agent Planning, Geoff Gordon, Pradeep Reddy Varakantham, William Yeoh, Ajay Srinivasan, Hoong Chuin Lau, Shih-Fen Cheng
Lagrangian Relaxation For Large-Scale Multi-Agent Planning, Geoff Gordon, Pradeep Reddy Varakantham, William Yeoh, Ajay Srinivasan, Hoong Chuin Lau, Shih-Fen Cheng
Research Collection School Of Computing and Information Systems
Multi-agent planning is a well-studied problem with applications in various areas. Due to computational constraints, existing research typically focuses either on unstructured domains with many agents, where we are content with heuristic solutions, or domains with small numbers of agents or special structure, where we can find provably near-optimal solutions. In contrast, here we focus on provably near-optimal solutions in domains with many agents, by exploiting influence limits. To that end, we make two key contributions: (a) an algorithm, based on Lagrangian relaxation and randomized rounding, for solving multi-agent planning problems represented as large mixed-integer programs; (b) a proof of …
Energy-Efficient Continuous Activity Recognition On Mobile Phones: An Activity-Adaptive Approach, Zhixian Yan, Vigneshwaran Subbaraju, Dipanjan Chakraborty, Archan Misra, Karl Aberer
Energy-Efficient Continuous Activity Recognition On Mobile Phones: An Activity-Adaptive Approach, Zhixian Yan, Vigneshwaran Subbaraju, Dipanjan Chakraborty, Archan Misra, Karl Aberer
Research Collection School Of Computing and Information Systems
Power consumption on mobile phones is a painful obstacle towards adoption of continuous sensing driven applications, e.g., continuously inferring individual’s locomotive activities (such as ‘sit’, ‘stand’ or ‘walk’) using the embedded accelerometer sensor. To reduce the energy overhead of such continuous activity sensing, we first investigate how the choice of accelerometer sampling frequency & classification features affects, separately for each activity, the “energy overhead” vs. “classification accuracy” tradeoff. We find that such tradeoff is activity specific. Based on this finding, we introduce an activity-sensitive strategy (dubbed “A3R” – Adaptive Accelerometer-based Activity Recognition) for continuous activity recognition, where the choice of …
Prioritized Shaping Of Models For Solving Dec-Pomdps, Pradeep Reddy Varakantham, William Yeoh, Prasanna Velagapudi, Paul Scerri
Prioritized Shaping Of Models For Solving Dec-Pomdps, Pradeep Reddy Varakantham, William Yeoh, Prasanna Velagapudi, Paul Scerri
Research Collection School Of Computing and Information Systems
An interesting class of multi-agent POMDP planning problems can be solved by having agents iteratively solve individual POMDPs, find interactions with other individual plans, shape their transition and reward functions to encourage good interactions and discourage bad ones and then recompute a new plan. D-TREMOR showed that this approach can allow distributed planning for hundreds of agents. However, the quality and speed of the planning process depends on the prioritization scheme used. Lower priority agents shape their models with respect to the models of higher priority agents. In this paper, we introduce a new prioritization scheme that is guaranteed to …
Ifalcon: A Neural Architecture For Hierarchical Planning, Budhitama Subagdja, Ah-Hwee Tan
Ifalcon: A Neural Architecture For Hierarchical Planning, Budhitama Subagdja, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
Hierarchical planning is an approach of planning by composing and executing hierarchically arranged predefined plans on the fly to solve some problems. This approach commonly relies on a domain expert providing all semantic and structural knowledge. One challenge is how the system deals with incomplete ill-defined knowledge while the solution can be achieved on the fly. Most symbolic-based hierarchical planners have been devised to allow the knowledge to be described expressively. However, in some cases, it is still difficult to produce the appropriate knowledge due to the complexity of the problem domain especially if the missing knowledge must be acquired …
Stochastic Dominance In Stochastic Dcops For Risk-Sensitive Applications, Nguyen Duc Thien, William Yeoh, Hoong Chuin Lau
Stochastic Dominance In Stochastic Dcops For Risk-Sensitive Applications, Nguyen Duc Thien, William Yeoh, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Distributed constraint optimization problems (DCOPs) are well-suited for modeling multi-agent coordination problems where the primary interactions are between local subsets of agents. However, one limitation of DCOPs is the assumption that the constraint rewards are without uncertainty. Researchers have thus extended DCOPs to Stochastic DCOPs (SDCOPs), where rewards are sampled from known probability distribution reward functions, and introduced algorithms to find solutions with the largest expected reward. Unfortunately, such a solution might be very risky, that is, very likely to result in a poor reward. Thus, in this paper, we make three contributions: (1) we propose a stricter objective for …
Delayed Observation Planning In Partially Observable Domains, Pradeep Reddy Varakantham, Janusz Marecki
Delayed Observation Planning In Partially Observable Domains, Pradeep Reddy Varakantham, Janusz Marecki
Research Collection School Of Computing and Information Systems
Traditional models for planning under uncertainty such as Markov Decision Processes (MDPs) or Partially Observable MDPs (POMDPs) assume that the observations about the results of agent actions are instantly available to the agent. In so doing, they are no longer applicable to domains where observations are received with delays caused by temporary unavailability of information (e.g. delayed response of the market to a new product). To that end, we make the following key contributions towards solving Delayed observation POMDPs (D-POMDPs): (i) We first provide an parameterized approximate algorithm for solving D-POMDPs efficiently, with desired accuracy; and (ii) We then propose …
Spatial Queries In Wireless Broadcast Environments [Keynote Speech], Kyriakos Mouratidis
Spatial Queries In Wireless Broadcast Environments [Keynote Speech], Kyriakos Mouratidis
Research Collection School Of Computing and Information Systems
Wireless data broadcasting is a promising technique for information dissemination that exploits the computational capabilities of mobile devices, in order to enhance the scalability of the system. Under this environment, the data are continuously broadcast by the server, interleaved with some indexing information for query processing. Clients may tune in the broadcast channel and process their queries locally without contacting the server. In this paper we focus on spatial queries in particular. First, we review existing methods on this topic. Next, taking shortest path computation as an example, we showcase technical challenges arising in this processing model and describe techniques …
Provable De-Anonymization Of Large Datasets With Sparse Dimensions, Anupam Datta, Divya Sharma, Arunesh Sinha
Provable De-Anonymization Of Large Datasets With Sparse Dimensions, Anupam Datta, Divya Sharma, Arunesh Sinha
Research Collection School Of Computing and Information Systems
There is a significant body of empirical work on statistical de-anonymization attacks against databases containing micro-dataabout individuals, e.g., their preferences, movie ratings, or transactiondata. Our goal is to analytically explain why such attacks work. Specifically, we analyze a variant of the Narayanan-Shmatikov algorithm thatwas used to effectively de-anonymize the Netflix database of movie ratings. We prove theorems characterizing mathematical properties of thedatabase and the auxiliary information available to the adversary thatenable two classes of privacy attacks. In the first attack, the adversarysuccessfully identifies the individual about whom she possesses auxiliaryinformation (an isolation attack). In the second attack, the adversarylearns additional …
Message Passing Algorithms For Map Estimation Using Dc Programming, Akshat Kumar, Shlomo Zilberstein, Marc Toussaint
Message Passing Algorithms For Map Estimation Using Dc Programming, Akshat Kumar, Shlomo Zilberstein, Marc Toussaint
Research Collection School Of Computing and Information Systems
We address the problem of finding the most likely assignment or MAP estimation in a Markov random field. We analyze the linear programming formulation of MAP through the lens of difference of convex functions (DC) programming, and use the concave-convex procedure (CCCP) to develop efficient message-passing solvers. The resulting algorithms are guaranteed to converge to a global optimum of the well-studied local polytope, an outer bound on the MAP marginal polytope. To tighten the outer bound, we show how to combine it with the mean-field based inner bound and, again, solve it using CCCP. We also identify a useful relationship …
Hierarchical Fuzzy Logic System For Implementing Maintenance Schedules Of Offshore Power Systems, C. S. Chang, Zhaoxia Wang, Fan Yang, W. W. Tan
Hierarchical Fuzzy Logic System For Implementing Maintenance Schedules Of Offshore Power Systems, C. S. Chang, Zhaoxia Wang, Fan Yang, W. W. Tan
Research Collection School Of Computing and Information Systems
Smart grid provides the technology for modernizing electricity delivery systems by using distributed and computer-based remote sensing, control and automation, and two-way communications. Potential benefits of the technology are that the smart grid's central control will now be able to control and operate many remote power plant, optimize the overall asset utilization and operational efficiently. In this paper, we propose an innovative approach for the smart grid to handle uncertainties arising from condition monitoring and maintenance of power plant. The approach uses an adaptive maintenance advisor and a system-maintenance optimizer for designing/implementing optimized condition-based maintenance activities, and collectively handles operational …
Extreme Learning Machine Terrain-Based Navigation For Unmanned Aerial Vehicles, Ee May Kan, Meng Hiot Lim, Yew Soon Ong, Ah-Hwee Tan, Swee Ping Yeo
Extreme Learning Machine Terrain-Based Navigation For Unmanned Aerial Vehicles, Ee May Kan, Meng Hiot Lim, Yew Soon Ong, Ah-Hwee Tan, Swee Ping Yeo
Research Collection School Of Computing and Information Systems
Unmanned aerial vehicles (UAVs) rely on global positioning system (GPS) information to ascertain its position for navigation during mission execution. In the absence of GPS information, the capability of a UAV to carry out its intended mission is hindered. In this paper, we learn alternative means for UAVs to derive real-time positional reference information so as to ensure the continuity of the mission. We present extreme learning machine as a mechanism for learning the stored digital elevation information so as to aid UAVs to navigate through terrain without the need for GPS. The proposed algorithm accommodates the need of the …