Patents
Literature
Patsnap Copilot is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Patsnap Copilot

66 results about "Mission time" patented technology

Task and Workflow Management System for Healthcare and other Applications

A task management system uses patient tags (e.g., wireless RFID, Infrared tracking, GPS etc.) for patient location tracking, together with an integrated workflow system to automatically, track patient location how long they have been there and how many patients are at the same location (e.g., waiting room) and manages waiting time and an overall waiting queue, supporting automated adjustment of healthcare staffing, patient flows, and team coordination. A task management system for use in providing healthcare to a patient includes a patient tracking processor and a workflow processor. The patient tracking processor automatically acquires data derived by wireless communication from patient attached tag devices for use in identifying a location of multiple patients in a healthcare enterprise and identifying a first number of patients at a particular location and a second number of patients awaiting receiving a particular type of treatment. The workflow processor automatically initiates a patient load balancing activity to improve a match between a healthcare resource and a patient load by communicating a message to update a healthcare worker task schedule with a task in response to a determination the identified first or second number of patients exceeds a predetermined threshold number.
Owner:SIEMENS AG

System and Method for Automated Optimized Personal Task Scheduling and Targeted Advertising

The present invention describes mobile phone applications that include methods and systems which automatically schedule tasks from a dynamically-changing task list for efficient utilization of available time. Unlike the prior personal task scheduling systems, the proposed system uses optimization algorithms and computer programs when creating a time schedule of tasks. In order to schedule individual tasks, the system takes into account multiple constraints controllable by the user. Basic constraints include individual task's deadline, start-time, minimum and maximum time-chunks for task fragments, relative priority of tasks (in case of time-collision), etc. Further constraints may include user's general preferences regarding individual task or group of tasks. Specifically, preferences may include time-of-day (e.g., morning, evening), location (e.g., home, work, particular grocery store or chain, particular gym, park), etc. In order to schedule the tasks, the system considers the user's calendar information and regards scheduled time-slots in the calendar as unavailable time for task scheduling. The system also considers as unavailable user-defined time periods reserved for such activities as sleeping, eating, resting, etc., unless the task specifically involves such activities. Furthermore, the system is flexible in the sense that the user can choose not to follow the advised task schedule and reprioritize tasks at his/her will. The system contains other interactive features such as issuing various task alerts to the user, allows the user to decline/delegate tasks and visualization (e.g. based on color coding) of the task-list (based on the status of the tasks, for example, close to completion, cannot be delegated etc.). The allocation is adaptive, in that, the schedule is automatically updated as new tasks enter the system, after task completions, when task priorities are modified, and based on other user inputs such as task declining/delegation. Finally, the system can be operated in a networked mode in which joint tasks involving multiple users (and their calendars) can be scheduled. Since the system will store the calendared event times of each user in the server, a joint task among multiple users can be scheduled based on the superimposed calendars of the users while protecting privacy of individual user's calendars.
Owner:BHATTACHARYA MAYUKH +2

Route planning method for autonomous underwater vehicle aiming at undetermined mission time

The invention relates to a route planning method for an autonomous underwater vehicle aiming at undetermined mission time. The route planning method is characterized by comprising the following steps of: encoding a route planning problem to obtain a population with a scale of N; estimating population fitness and selecting N good individuals from the current population; carrying out interlace operation on the good individuals at a probability of pc; carrying out mutation operation on the interlaced good individuals at a probability of pm; carrying out an elicitation type mutation operation to obtain an optimal individual; and decoding the optimal individual according to an encoding rule in the step 1, so as to obtain a planned route of each AUV (Autonomous Underwater Vehicle). The route planning method for the autonomous underwater vehicle aiming at the undetermined mission time provided by the invention can be used for planning the routes of a plurality of AUVs, so as to realize cooperative route plane of a multi-AUV system, and ensure the global optimum of a planning result. Furthermore, the route planning method has the characteristics that use is convenient and generality is strong, and can be applied to the route plane of a robot and the like.
Owner:NORTHWESTERN POLYTECHNICAL UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products