-
公开(公告)号：KR1020140008755A
公开(公告)日：2014-01-22
申请号：KR1020120075762
申请日：2012-07-11
Applicant: 제주대학교 산학협력단
IPC: B60L11/18
CPC classification number: Y02T10/7005 , B60L11/1848 , B60L11/1861 , B60L2230/30 , B60Y2200/91
Abstract: Provided are a method and a system for optimizing a route of an electric vehicle using the waiting time. A method for scheduling a route comprises the steps of identifying a plurality of charging points existing in a certain route; obtaining the waiting time required to charge the electric vehicle in the charging points; and determining a visiting order of the charging points based on the waiting time. [Reference numerals] (310) Identify charging points; (320) Obtain the waiting time; (330) Determine a visiting order; (AA) Start; (BB) End
Abstract translation: 提供了一种使用等待时间来优化电动车辆的路线的方法和系统。 一种用于调度路由的方法包括以下步骤：识别存在于特定路由中的多个充电点; 获取在充电点充电电动车辆所需的等待时间; 以及基于所述等待时间来确定所述充电点的访问顺序。 （附图标记）（310）识别充电点; （320）取得轮候时间; （330）确定访问订单; （AA）开始; （BB）结束
-
公开(公告)号：KR1020130050312A
公开(公告)日：2013-05-15
申请号：KR1020130021364
申请日：2013-02-27
Applicant: 제주대학교 산학협력단
CPC classification number: G06Q50/30 , B60L11/1824 , H02J7/00 , H02J7/0027
Abstract: PURPOSE: A charging task scheduling method of an electric vehicle and a device thereof are provided to evenly distribute power by using a scheduling method based on reserved information when the electric vehicle is charged. CONSTITUTION: A charging task scheduling device prepares a power consumption profile corresponding to obtained charging tasks and determines scheduling sequence of the obtained charging tasks(210-230). The charging task scheduling device selects one of charging tasks corresponding to the scheduling sequence(240). The charging task scheduling device selects at least one of time slots which satisfies a real-time limitation condition of a selected charging task and schedules the selected charging task(250,260). [Reference numerals] (210) Step of obtaining a plurality of charging tasks; (220) Step of preparing a power consumption profile corresponding to the plurality of charging tasks; (230) Step of determining scheduling sequence of the plurality of charging tasks; (240) Step of selecting one charging task; (250) Step of selecting a time slot; (260) Step of scheduling the selected charging task; (270) Plurality of charging tasks all scheduled?; (AA) Start; (BB) End
Abstract translation: 目的：提供电动车辆的充电任务调度方法及其装置，以便在电动车辆被充电时，通过使用基于保留信息的调度方法来均衡地分配功率。 规定：计费任务调度装置准备与获得的计费任务对应的功耗曲线，并确定所获得的计费任务的调度顺序（210-230）。 计费任务调度装置选择与调度序列对应的计费任务之一（240）。 计费任务调度装置选择满足所选择的计费任务的实时限制条件的时隙中的至少一个，并且对所选择的计费任务进行调度（250,260）。 （附图标记）（210）获得多个充电任务的步骤; （220）准备与多个充电任务对应的功耗曲线的步骤; （230）确定所述多个计费任务的调度序列的步骤; （240）选择一次充电任务的步骤; （250）选择时隙的步骤; （260）调度所选择的计费任务的步骤; （270）多次充电任务全部预定？ （AA）开始; （BB）结束
-
公开(公告)号：KR1020100116421A
公开(公告)日：2010-11-01
申请号：KR1020090035110
申请日：2009-04-22
Applicant: 제주대학교 산학협력단
IPC: H04L12/28
CPC classification number: H04L45/12
Abstract: PURPOSE: A shortest path search method for K-nearest neighbor queries and a device are provided to store distance information to each node which a user visited, thereby using the stored distance information next time. CONSTITUTION: A static object search unit(410) search one or more static objects located in selected distance from a query point on road network. A node determining unit(420) determines one or more destination nodes corresponding to the one or more searched static objects. A distance information output unit(430) calculates one or more first distance information between one or more determined destination nodes and point of queries.
Abstract translation: 目的：提供K最近邻查询的最短路径搜索方法和设备，用于将距离信息存储到用户访问的每个节点，从而使用下一次存储的距离信息。 构成：静态对象搜索单元（410）搜索位于道路网络上的查询点的选定距离内的一个或多个静态对象。 节点确定单元（420）确定与一个或多个搜索到的静态对象相对应的一个或多个目的地节点。 距离信息输出单元（430）计算一个或多个确定的目的地节点和查询点之间的一个或多个第一距离信息。
-
公开(公告)号：KR1020100079722A
公开(公告)日：2010-07-08
申请号：KR1020080138275
申请日：2008-12-31
Applicant: 제주대학교 산학협력단
CPC classification number: H04W72/1252 , H04W40/02 , H04W72/1242 , H04W84/18
Abstract: PURPOSE: A method and an apparatus for scheduling a real time message in a mobile ad-hoc sensor network are provided to determine a destination according to a transmitting feature of a message to perform message scheduling, thereby scheduling the message in real time in the ad-hoc sensor network. CONSTITUTION: A queue(410) stores a message for reception or transmission. A scheduler(420) schedules the message to transmit the message of the queue to one of the first and second sync nodes. An importance determining unit(430) determines importance of the stored message for real time scheduling of the scheduler. The scheduler schedules the message based on the importance.
Abstract translation: 目的：提供一种用于在移动自组织传感器网络中调度实时消息的方法和装置，以根据消息的发送特征来确定目的地以执行消息调度，由此在广告中实时调度消息 -hoc传感器网络。 构成：队列（410）存储用于接收或传输的消息。 调度器（420）调度消息以将队列的消息发送到第一和第二同步节点之一。 重要性确定单元（430）确定存储的消息对调度器的实时调度的重要性。 调度器根据重要性调度消息。
-
公开(公告)号：KR100968676B1
公开(公告)日：2010-07-06
申请号：KR1020080063040
申请日：2008-06-30
Applicant: 제주대학교 산학협력단
IPC: G01S5/14
Abstract: 본 발명의 위치 기반 서비스에서 그룹 관리에 의한 위치 정보 처리 기법은, 제1 위치 정보와 인접한 하나 이상의 제1 도로 정보를 추출하는 단계, 상기 제1 위치 정보와 상기 하나 이상의 제1 도로 정보간의 편차 정보를 각각 계산하는 단계, 제2 위치 정보와 인접한 하나 이상의 제2 도로 정보를 추출하는 단계, 상기 제2 위치 정보와 상기 하나 이상의 제2 도로 정보간의 편차 정보를 각각 계산 하는 단계, 위치 정보가 확실한 제3 위치 정보에 대응하는 제3 도로 정보를 생성하는 단계, 상기 제3 도로 정보로부터 기준 편차 정보를 추출하는 단계, 상기 기준 편차 정보와 상기 제1 도로 정보 및 제2 도로 정보에 대한 각각의 편차 정보가 동일한지 여부를 판단하는 단계 및 상기 판단 결과, 상기 기준 편차 정보와 상기 각 편차 정보 중 동일한 편차 정보에 대한 도로 정보를 지도의 도로 정보로 지정하는 단계를 포함한다.
위치 정보, LBS, GPS, 도로-
Patent Agency Ranking
公开(公告)号：KR1020080099560A
公开(公告)日：2008-11-13
申请号：KR1020070045264
申请日：2007-05-10
Applicant: 제주대학교 산학협력단
IPC: G01C21/30 , G08G1/0969
CPC classification number: G01C21/30 , G01C21/36 , G08G1/096805 , G08G1/0969
Abstract: A memory optimization method of a telematics service system based on the virtual link for efficient map matching is provided to remove a disk operation by extracting only essential part from a road network and storing it in the memory. A navigation method storing only a small amount of link data by applying virtual link comprises the following steps. A part of a road network is extracted through an off-line map analysis function and unnecessary vertexes are removed in order to share the network data with the online map matching part for the purpose of map matching. The road network is initialized into a graph consisting of nodes and links. Local map matching is performed at 10 division points of each segment, and whether to add the segment as virtual link to a map matching road network is determined. The determined virtual link is added to the graph and converted into the structure to be loaded in the memory. As to the memory structure, the distance between the coordinate and each link is calculated and the map matching is performed.
Abstract translation: 提供了一种基于用于高效映射匹配的虚拟链路的远程信息处理服务系统的存储器优化方法，通过仅从道路网络中提取必要部分并将其存储在存储器中来去除磁盘操作。 通过应用虚拟链接仅存储少量链接数据的导航方法包括以下步骤。 通过离线地图分析功能提取路网的一部分，并删除不必要的顶点，以便与地图匹配的目的与在线地图匹配部分共享网络数据。 路网被初始化为由节点和链路组成的图。 确定每个段的10个分区进行局部地图匹配，并确定是否将该段作为虚拟链路添加到匹配道路网的地图。 确定的虚拟链路被添加到图形中并转换成要加载到存储器中的结构。 对于存储器结构，计算坐标和每个链接之间的距离，并且执行地图匹配。
-
公开(公告)号：KR1020080007982A
公开(公告)日：2008-01-23
申请号：KR1020060067295
申请日：2006-07-19
Applicant: 제주대학교 산학협력단
IPC: G06F17/40
CPC classification number: G06F17/30327 , G06F17/30424 , G06F17/30607
Abstract: A method for constructing a future position search index is provided to support future position search of a mobile object efficiently and improve search processing performance of the index by estimating a search cost from a search pattern analysis of a user accessing a mobile object database. A query process for processing a user query for the mobile object database accesses a predetermined node(S31). CBR(Conservative Bounding Rectangle) information of the accessed node is stored to a memory(S32). The query process determines whether the accessed node is a terminal node(S33). The query process is returned to a first stage by finding a child node corresponding to the query process based on the CBR information of the accessed node when the accessed node is not the terminal node(S34). The CBR at a time point accessing the accessed node is adjusted and stored to the database for the query process for the nodes stored in the memory when the accessed node is the terminal node(S35). A query result for the query process is returned to the user and the query process is terminated(S36).
Abstract translation: 提供一种用于构建未来位置搜索索引的方法，以有效地支持移动对象的未来位置搜索，并通过从访问移动对象数据库的用户的搜索模式分析来估计搜索成本来提高索引的搜索处理性能。 用于处理移动对象数据库的用户查询的查询处理访问预定节点（S31）。 访问节点的CBR（保守边界矩形）信息被存储到存储器中（S32）。 查询过程确定所访问的节点是否是终端节点（S33）。 当访问节点不是终端节点时，通过基于被访问节点的CBR信息找到与查询过程相对应的子节点，将查询过程返回到第一阶段（S34）。 当访问节点是终端节点时，在访问被访问节点的时间点上的CBR被调整并存储到用于存储在存储器中的节点的查询处理的数据库（S35）。 查询过程的查询结果返回给用户，查询过程终止（S36）。
-
-
-
公开(公告)号：KR101870035B1
公开(公告)日：2018-06-21
申请号：KR1020160127594
申请日：2016-10-04
Applicant: 제주대학교 산학협력단
Abstract: 센서노드들및 기계학습을이용한객체수 측정방법및 장치가개시된다. 일실시예에따른객체수 측정방법은센서노드들각각에의해동일시점에측정된, 상기센서노드들각각과타겟영역에위치한적어도하나의객체사이의거리를나타내는측정치들을수신하는단계; 타겟시점에상기센서노드들이위치한지점들에서측정된상기지점들각각과상기타겟영역에위치한적어도하나의객체와의거리를나타내는측정치및 상기타겟시점에상기타겟영역에위치한객체의수로구성된학습샘플에의해미리학습된뉴럴네트워크에, 상기측정치들을입력하는단계; 및상기뉴럴네트워크의출력에기초하여상기타겟영역에위치한객체의수를결정하는단계를포함한다.
-
-
-
-
-
-
-
-
-
Search Results
73
records
(took 0.027 seconds)
